Armstrong Numbers upto 'n' numbers in JAVA

Armstrong Number in JAVA

Armstrong Number: A number is said to be Armstrong Number, If it is a equal to the sum of its own digits each raised to the power of the number of digits.


Example:
Input                   : 153
No. of Digits       : 3
Sum of digits      : 13 + 53 + 33 = 1 + 125 + 27 = 153
Output                 : It is an Armstrong Number

Input                  : 15
No. of Digits      : 2
Sum of digits     : 12 + 52 = 1 + 25 = 26
Output                : It is not an Armstrong Number

Input                  : 1634
No. of Digits     : 4
Sum of digits    : 14 + 64 + 34 + 44 = 1 + 1296 + 81 + 256 = 1634
Output               : It is an Armstrong Number


Algorithm and Program given below :-

Algorithm :-

  • Input a number
  • Use for loop from 0 to the input number
  • Copy the value of loop variable in another variable
  • Using a string variable convert the integer value into string
  • Store the length of this string in another variable.
  • Using while loop calculate the sum of digits raised with the power of number of digits in a variable say ‘s’.
  • Compare the calculated number with the original number
  • If the numbers are equal print the number.
  • Initialize value of s=0 within the for loop again.
  • Compile and run the program
 
Program :-

import java.io.*;
import java.util.*;
class Armstrong1
{
    public static void main(String args[])
    {
        Scanner in= new Scanner(System.in);
        int n,p,rev,i,l;
        double s=0;
        String str;
        System.out.println("Enter the number");
        n= in.nextInt(); // Enter Number from user
        System.out.println("Armstrong Number from 0 to "+n+" are:-");
        for(i=0;i<=n;i++)
        {
            p=i;
            str= Integer.toString(i);
            l= str.length();
            while(p>0)
            {
                rev= p%10; // extracting last digit of the number
                s=s+Math.pow(rev,l); // Storing digit with respective power
                p=p/10; // extracting quotient of the number
            }
            if(s==i) // checking entered number with cubes of its digits
            {
                System.out.println(i);
            }
            s=0;
        }
    }// end of main method
}// end of class

Video Link of this Program : https://youtu.be/Ldsyc7hfUr4

Follow me on Instagram

All the Best :)
Keep Learning :)

 


Comments

Post a Comment

Popular posts from this blog

Frequency of each digit of a number in Java

Image
Frequency of each digit of a Number Question :   Write a program to count and display the frequency of each digit of a number. For Example  :-   Input                                                            : 19224 Output                                                      :   Frequency of 1 is : 1                                                                        Frequency of 2 is : 2          ...
Read more

Trimorphic Number in JAVA

Trimorphic Number Trimorphic Number : A number is called Trimorphic Number if and only if its cube ends in the same digits as the number itself.  Or  A number ‘n’ is called Trimorphic if ‘n^3’ ends in ‘n’  Example :- Input : 5  Cube : 5 X 5 X 5 = 625  Output : It is Trimorphic Number  Input : 49  Cube : 49 X 49 X 49 = 117649  Output : It is a Trimorphic Number  Input : 7  Cube : 7 X 7 X 7 = 343  Output : It is not a Trimorphic Number   Algorithm and Program given below :-
Read more

Tri-Automorphic Number in JAVA

Tri-Automorphic Number Tri-Automorphic Number : A number is called Tri-Automorphic number if the last digits of 3 times the square of the number is equal to the number itself. Or A number ‘n’ is called Tri-Automorphic if ‘3n 2 ’ ends in ‘n’. Example :- Input      : 5 Sqaure    : 3 X (5 X 5) = 75 Output    : It is a Tri-Automorphic Number Input      : 667 Sqaure    : 3 X 667 X 667 = 1334667 Output    : It is a Tri-Automorphic Number   Input      : 12 Square    : 3 X 12 X 12 = 432 Output    : It is not a Tri-Automorphic Number Algorithm and Program given below :-
Read more