Question

Using the following functions, modify the Python program written for the perfect number into TDD Java program: 1) divisors (n) - takes a positive integer 'n' and return it's divisors sum as output. 2) isPerfect(n) - takes a positive integer 'n' as input and produces the result either as 'n is perfect' or 'n is not perfect using the function divisors()

Answer 1

def divisors(n):
    s = 1
    for x in range(2,n):
        if(n%x == 0):
            s += x
    return s

def isperfect(n):
    if(divisors(n) == n):
        print('n is perfect')
    else:
        print('n is not perfect')

#Testing
def main():
    n = int(input("Enter value for n: "))
    isperfect(n)

main()

$\color{red}Please\; upvote\;the \;solution \;if \;it \;helped.\;Thanks!$