ch01_ex131_prof.py

Created by manuel-2de-indice2019

Created on October 11, 2019

187 Bytes

def parfait(n):
    S=0
    for k in range(1,n):
        if n%k==0:
            S=S+k
    if S==n:
        return("parfait")
    else:
        return("non parfait")