Write an Assembley Language.Given a number x, determine whether thegiven number is Armstrong number or not. A positive integer ofn digits is called an Armstrong number oforder n(where order is the number ofdigits) if.
abcd…= pow(a,n) +pow(b,n) +pow(c,n) +pow(d,n) + ….
Example:
- Input : 153 Output : Yes, 153 is an Armstrong number. 1*1*1 +5*5*5 + 3*3*3 = 153
- Input : 120 Output : No, 120 is not a Armstrong number. 1*1*1 +2*2*2 + 0*0*0 = 9
- Input : 1253 Output : No, 1253 is not a Armstrong Number1*1*1*1 + 2*2*2*2 + 5*5*5*5 + 3*3*3*3 = 723
- Input : 1634 Output : Yes, 1*1*1*1 + 6*6*6*6 + 3*3*3*3 +4*4*4*4 = 1634
HINT: Use the ReadString function found in the Irvine32 library tocapture the user’s input.
Expert Answer
Answer to Write an Assembley Language.Given a number x, determine whether the given number is Armstrong number or not. A positive …