Skip to content

AbundantNumber #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
dipeshguptaa merged 1 commit into from
Oct 7, 2020
Merged

AbundantNumber #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
47 changes: 47 additions & 0 deletions AbundantNumber
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,47 @@
import math

# Function to calculate sum of divisors
def getSum(n) :
sum = 0

# Note that this loop runs till square root
# of n
i = 1
while i <= (math.sqrt(n)) :
if n%i == 0 :

# If divisors are equal,take only one
# of them
if n/i == i :
sum = sum + i
else : # Otherwise take both
sum = sum + i
sum = sum + (n / i )
i = i + 1

# calculate sum of all proper divisors only
sum = sum - n
return sum

# Function to check Abundant Number
def checkAbundant(n) :

# Return true if sum of divisors is greater
# than n.
if (getSum(n) > n) :
return 1
else :
return 0

# Driver program to test above function */
if(checkAbundant(12) == 1) :
print "YES"
else :
print "NO"

if(checkAbundant(15) == 1) :
print "YES"
else :
print "NO"

# This code is contributed by Nikita Tiwari.