Skip to content

Commit c03fec4

Browse files
DeficientNum
Python program to implement an Optimized Solution to check Deficient Number
1 parent 99cf7d7 commit c03fec4

1 file changed

Lines changed: 39 additions & 0 deletions

File tree

‎DeficientNum‎

Lines changed: 39 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
import math
2+
3+
# Function to calculate sum of divisors
4+
def divisorsSum(n) :
5+
sum = 0 # Initialize sum of prime factors
6+
7+
# Note that this loop runs till square
8+
# root of n
9+
i = 1
10+
while i<= math.sqrt(n) :
11+
if (n % i == 0) :
12+
13+
# If divisors are equal, take only one
14+
# of them
15+
if (n / i == i) :
16+
sum = sum + i
17+
else : # Otherwise take both
18+
sum = sum + i;
19+
sum = sum + (n / i)
20+
i = i + 1
21+
return sum
22+
23+
# Function to check Deficient Number
24+
def isDeficient(n) :
25+
26+
# Check if sum(n) < 2 * n
27+
return (divisorsSum(n) < (2 * n))
28+
29+
# Driver program to test above function
30+
if ( isDeficient(12) ):
31+
print "YES"
32+
else :
33+
print "NO"
34+
if ( isDeficient(15) ) :
35+
print "YES"
36+
else :
37+
print "NO"
38+
39+
# This Code is contributed by Nikita Tiwari

0 commit comments

Comments
 (0)