Answer
def Armstrong(n):
sum=0
count=n
while(count>0):
sum=sum+(count%10)**3
/* here // operator is for floor division */
count=count//10
if (sum==n):
return True
return False
Work Step by Step
The Armstrong function checks if the given number is Armstrong or not by calculating the sum cube of every digit and checking if that is equal to the number or not.
See algorithm:
def Armstrong(n):
sum=0
count=n
while(count>0):
sum=sum+(count%10)**3
/* here // operator is for floor division */
count=count//10
if (sum==n):
return True
return False
