tag:blogger.com,1999:blog-694855878384792308.post5941749257506403351..comments2024-03-21T06:26:49.387-07:00Comments on Java67: Java Program to find Armstrong numbers with Examplejavin paulhttp://www.blogger.com/profile/15028902221295732276noreply@blogger.comBlogger11125tag:blogger.com,1999:blog-694855878384792308.post-47213968827840024432017-04-26T06:28:17.080-07:002017-04-26T06:28:17.080-07:00Thanx...Thanx...Ananya MAllikhttps://www.blogger.com/profile/02768814201775855464noreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-42624113685713232742016-09-18T07:38:58.620-07:002016-09-18T07:38:58.620-07:00Hi All,
Just generalised the very first answer wh...Hi All,<br /><br />Just generalised the very first answer while trying to solve Armstrong example. Hope it is useful :)<br /><br />import java.util.Scanner;<br /><br />public class ArmstrongNumbers {<br /><br /> public static void main(String[] args) {<br /> System.out.println("Hello Enter your number");<br /> Scanner sc=new Scanner(System.in);<br /> Long n=sc.nextLong();<br /> Long orignal=n;<br /> System.out.println("Your number is - "+n);<br /> <br /> <br /> long rem;<br /> long result=0;<br /> String forLength=n.toString();<br /> int length = String.valueOf(forLength).length();<br /> System.out.println("Length "+length);<br /> <br /> <br /> while(n!=0){<br /> rem=n%10;<br /> System.out.println("Rem "+rem);<br /> result=(long) (result+Math.pow(rem, length));<br /> System.out.println("Result " +result);<br /> n=n/10;<br /> }<br /> if(result == orignal){<br /> System.out.println("Armstrong");<br /> }<br /> else{<br /> System.out.println("Not Armstrong");<br /> }<br /> }<br /><br />}<br />shwetahttps://www.blogger.com/profile/00535493840619190032noreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-51355806186271719422016-02-19T08:56:42.987-08:002016-02-19T08:56:42.987-08:00Yes, you are right. The correct definition of Arms...Yes, you are right. The correct definition of Armstrong number is:-<br />ex. 153. if 1^3+5^3+3^3 = 153 then it is an Armstrong number. In words, a number whose sum is equal to the sum of the cubes of its digits then it is an Armstrong numberAnonymoushttps://www.blogger.com/profile/08310908114366065629noreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-63310530406449175742015-03-04T11:06:45.087-08:002015-03-04T11:06:45.087-08:00Using String will generalize to find ArmStrong Num...Using String will generalize to find ArmStrong Number for 2 digits, 3 digits or 4 digits since we can capture the length and use Math.pow(number,length) which will make the code generic.Ganesh Rhttps://www.blogger.com/profile/07630724960238398953noreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-21801078960974680882015-03-02T09:20:54.790-08:002015-03-02T09:20:54.790-08:00package com.example.test.nover;
import java.util.L...package com.example.test.nover;<br />import java.util.List;<br />import java.util.ArrayList;<br />public class ArmstrongNumber {<br /><br /> public void findNumber() {<br /> List numList = new ArrayList();<br /> int newNum = 0;<br /> String numVal= "";<br /> int length = 0;<br /> for(int i = 1000; i<=9999; i++) {<br /> numVal = (numVal+i).trim();<br /> length = numVal.length();<br /> for(int j=0;j<length;j++) {<br /> char charVal = numVal.charAt(j);<br /> int charNum = charVal-'0';<br /> charNum = (int) Math.pow(charNum,4);<br /> //int charNo = (int) Math.pow(charNum,4);<br /> newNum = newNum + charNum;<br /> }<br /> if(i==newNum) <br /> numList.add(i);<br /> newNum = 0;<br /> numVal="";<br /> }<br /> for(int i: numList) {<br /> System.out.println("NUMBERS FOUND ARE " +i);<br /> }<br /> }<br /><br /> public static void main(String args[]) {<br /> ArmstrongNumber numVer = new ArmstrongNumber();<br /> numVer.findNumber();<br /> }<br />}Ganesh Rhttps://www.blogger.com/profile/07630724960238398953noreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-90859426986416545392014-08-15T03:08:54.932-07:002014-08-15T03:08:54.932-07:00I'd do it like this....
public stati...I'd do it like this....<br /><br /> public static void armstrong(int number){<br /> String numToString = String.valueOf(number);<br /> int number1;<br /> int multiplication = 0;<br /> for (int i=0; i<=numToString.length()-1; i++){<br /> number1 = Character.getNumericValue(numToString.charAt(i));<br /> multiplication = multiplication + number1 * number1 * number1;<br /> }<br /> if (number == multiplication) {<br /> System.out.println("Number : " + number + " is an Armstrong number");<br /> } else {<br /> System.out.println("Number : " + number + " is not an Armstrong number");<br /> }<br /> }Anonymoushttps://www.blogger.com/profile/05695302054022388448noreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-58372577200595483962014-02-24T08:06:23.542-08:002014-02-24T08:06:23.542-08:00I'd probably do it like this:
public boolean ...I'd probably do it like this:<br /><br />public boolean isArmstrong(int i) {<br /> return (i >= 100) && (i <= 999) && (sumCubeDigits(i) == i);<br />}<br /><br />private int sumCubeDigits(int digits) {<br /> if (digits == 0)<br /> return 0;<br /> else <br /> return cube(digits % 10) + sumCubeDigits(digits / 10);<br />}<br /><br />private int cube(int i) {<br /> return i * i * i;<br />}<br /><br />and if it turned out to be too slow, like this:<br /><br />public boolean isArmstrong(int i) {<br /> if ((i < 100) || (i > 999)) {<br /> return false;<br /> } else {<br /> int a = i % 10;<br /> int b = (i / 10) % 10;<br /> int c = i / 100;<br /> int sumOfCubes = (a*a*a) + (b*b*b) + (c*c*c);<br /> return (i == sumOfCubes);<br /> }<br />}Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-50216499665155506282013-10-16T10:27:33.478-07:002013-10-16T10:27:33.478-07:00The definition of an Armstrong Number was not that...The definition of an Armstrong Number was not that clear to me. I looked up here and figured out what it is: http://www.cs.mtu.edu/~shene/COURSES/cs201/NOTES/chap04/arms.htmlAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-16794227085005194772013-10-09T17:26:22.348-07:002013-10-09T17:26:22.348-07:00According to Abhirupa Mitra's code numbers fro...According to Abhirupa Mitra's code numbers from 1 to 9 would be displayed as Armstrong numbers which is not correct. What is the correct definition of Armstrong numbers? Within 1 to 10 only 1 is an armstrong number.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-7175896480746045732012-10-05T08:31:00.845-07:002012-10-05T08:31:00.845-07:00/*
Simple Java Program to check or find if a numb.../*<br /> Simple Java Program to check or find if a number is Armstrong number or not.<br /> [ An Armstrong number of any number of digit is a number whose sum of each digits raised to the power the total no. of digits is equal to it (the original number). For example, 9474 is an Armstrong number of 4 digits because 9^4 + 4^4 + 7^4 + 4^4 = 6561 + 256 + 2401 = 9474 ]<br />*/<br /><br />import java.io.*;<br />import java.util.*;<br /><br />public class ArmstrongNumber<br />{ <br /> public static void main(String args[]) <br /> {<br /> <br /> // Input number to check if its Armstrong number<br /> System.out.println("Please enter a number to find if it is an Armstrong number: ");<br /> int number = new Scanner(System.in).nextInt();<br /> <br /> // Printing result<br /> if(isArmStrong(number))<br /> {<br /> System.out.println(number + " is an Armstrong number");<br /> }<br /> else<br /> {<br /> System.out.println(number + " is not an Armstrong number");<br /> }<br /><br /> } // End of main()<br /><br /> // Function returning true if number is Armstrong number or returning false<br /> <br /> private static boolean isArmStrong(int number) <br /> {<br /> int result = 0;<br /> int dc=0; <br /> int orig = number;<br /> while(orig != 0)<br /> { <br /> dc++; <br /> orig = orig/10;<br /> }<br /> orig = number;<br /> while (orig!=0)<br /> {<br /> result = result + (int)Math.pow(orig%10, dc);<br /> orig = orig/10;<br /> }<br /> if(number == result)<br /> return true; <br /> else<br /> return false;<br /> } // End of isArmStrong() <br />}<br /><br />OUTPUT:<br />Please enter a number to find if it is an Armstrong number: <br />9474<br />9474 is an Armstrong number<br /><br />Please enter a number to find if it is an Armstrong number: <br />8208<br />8208 is an Armstrong number<br />Abhirupa Mitrahttps://www.blogger.com/profile/12341030546934220519noreply@blogger.comtag:blogger.com,1999:blog-694855878384792308.post-17404664422171026312012-08-30T19:51:41.192-07:002012-08-30T19:51:41.192-07:00Good tutorial, How to find Armstrong number with m...Good tutorial, How to find Armstrong number with more than 3 digits ?Anonymousnoreply@blogger.com