How to check whether given number is Armstrong or not in Java?
Problem Description :
Write a program in Java that checks whether given number is Armstrong or not.
 |
| Number is Armstrong or not? |
Concept :
Armstrong number is a number that is equal to the sum of cubes of its digits. For example 153 because 153 = 1*1*1 + 5*5*5 + 3*3*3.
Java Program :
Output :
Case 1 :
 |
| Given number is not Armstrong |
Case 2 :
 |
| Given number is Armstrong |
You might also like :
How to find factorial of large number?
How to generate divisors of any given number?
How to generate first N triangular numbers?
How to generate first N pentagonal numbers?
How to generate first N hexagonal numbers?
References :
http://docs.oracle.com/javase/7/docs/api/java/lang/String.html
Thank you friends, I hope you have clearly understood the solution of this problem. If you have any doubt, suggestion or query please feel free to comment below. You can also discuss this solution in our forum.
Tags : Number Problems, Armstrong Number, if else statement, for loop, String, Regular expressions, Mathematics Problem.
About Author:
I am simple guy with lot of ambitions. My main motive is to share whatever knowledge I have related to programming. With me you can easily learn how to solve any programming problem in Java.You can connect with me on social networking sites also.
Let's Get Connected: Linkedin | Facebook | Google Plus
How to check whether given number is Armstrong or not in Java?
Reviewed by Rohit Agarwal
on
3/10/2017
Rating:
Reviewed by Rohit Agarwal
on
3/10/2017
Rating:
Explanation on armstrong concept is good. Thanks for sharing.
ReplyDeleteCheers,
http://www.flowerbrackets.com/armstrong-number-in-java-program/