Jan-03-2019, 06:57 AM
I had to define f
def f(): thats all and here is the code.
def f(): thats all and here is the code.
import math KB = 1024 MB = 1024 * 1024 def perfect_number(number, factors): sum_of_factors = sum(factors) - number if sum_of_factors == number: def f(): return f#"The number {number} is a Perfect number!" else: return f#"The number {number} is not a Perfect number!" def factor_number(n): root = int(round(math.sqrt(n), 0)) return [(x, n // x) for x in range(1, root + 1) if n % x == 0] if __name__ == '__main__': with open('6.txt', buffering=1*MB) as bigggg: for num in bigggg: number = int(num) factors = [] for pair in factor_number(number): factors.extend(pair) print(perfect_number(number, factors)) factors = [] for pair in factor_number(6): factors.extend(pair) print(perfect_number(6, factors))