python program:

An integer n> 1 is perfect if the sum of its strict divisors (that is, the divisors strictly less than n) is equal to n. For example, the strict divisors of 10 are 1, 2 and 5 (we do not take divisor 10). We have 1 + 2 + 5 = 8 10 so 10 is not perfect. But the 6 is perfect because 1 + 2 + 3 = 6. Write a function isParfait (n) which takes as argument a nonzero natural integer n and returns true if n is perfect and false otherwise. Write a listPerfect (N) function that takes as argument a nonzero natural integer N and returns the list of perfect numbers less than or equal to N. Derive the perfect numbers less than 1000, display the calculation time using the time function of the time module. Example: from time import time