Run
def armstrong(num): num = str(num) n = len(num) result = 0 # compute pow(a,n)+pow(b,n)+... for i in num: result+=pow(int(i),n) #no need to check if part of the expansion exceeds the given number if(result>int(num)): break #check if given number equals expansion if(int(num)==result): return True else: return False
Output