forked from fenyx-it-academy/Class8-Python-Module-Week3
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAssignment_3.py
More file actions
19 lines (15 loc) · 1.06 KB
/
Assignment_3.py
File metadata and controls
19 lines (15 loc) · 1.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
# Assement 3
# Write a Python function to check whether a number is perfect or not.
# According to Wikipedia : In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself (also known as its aliquot sum). Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (including itself).
# Example : The first perfect number is 6, because 1, 2, and 3 are its proper positive divisors, and 1 + 2 + 3 = 6. Equivalently, the number 6 is equal to half the sum of all its positive divisors: ( 1 + 2 + 3 + 6 ) / 2 = 6. The next perfect number is 28 = 1 + 2 + 4 + 7 + 14. This is followed by the perfect numbers 496 and 8128.
def perfect_number(n):
sum = 0
for i in range(1, n):
if n % i == 0:
sum += i
if (sum == n):
return "The number is a Perfect number!"
else:
return "The number is not a Perfect number!"
num = int(input("Enter any number: "))
print(perfect_number(num))