Java Basic
Java Interview Programs
- Java Interview Programs
- Java Abundant Number
- Java Amicable Number
- Java Armstrong Number
- Java Average of N Numbers
- Java Automorphic Number
- Java Biggest of three numbers
- Java Binary to Decimal
- Java Common Divisors
- Java Composite Number
- Java Condense a Number
- Java Cube Number
- Java Decimal to Binary
- Java Decimal to Octal
- Java Disarium Number
- Java Even Number
- Java Evil Number
- Java Factorial of a Number
- Java Fibonacci Series
- Java GCD
- Java Happy Number
- Java Harshad Number
- Java LCM
- Java Leap Year
- Java Magic Number
- Java Matrix Addition
- Java Matrix Division
- Java Matrix Multiplication
- Java Matrix Subtraction
- JS Matrix Transpose
- Java Maximum Value of an Array
- Java Minimum Value of an Array
- Java Multiplication Table
- Java Natural Number
- Java Number Combination
- Java Odd Number
- Java Palindrome Number
- Java Pascalβs Triangle
- Java Perfect Number
- Java Perfect Square
- Java Power of 2
- Java Power of 3
- Java Pronic Number
- Java Prime Factor
- Java Prime Number
- Java Smith Number
- Java Strong Number
- Java Sum of Array
- Java Sum of Digits
- Java Swap Two Numbers
- Java Triangular Number
Java Program to Check Armstrong Number
Photo Credit to CodeToFun
π Introduction
In the realm of programming, solving mathematical problems is a common task. One such interesting problem is checking whether a given number is an Armstrong number.
Armstrong numbers, also known as narcissistic numbers or pluperfect digital invariants, are numbers that are the sum of their own digits each raised to the power of the number of digits.
In this tutorial, we will explore a Java program designed to check whether a given number is an Armstrong number. The program involves calculating the sum of the digits raised to the power of the number of digits and comparing it with the original number.
π Example
Let's delve into the Java code that accomplishes this task.
import java.util.Scanner;
public class ArmstrongNumber {
// Function to check if a number is an Armstrong number
static boolean isArmstrong(int number) {
int originalNumber, remainder, n = 0, result = 0;
// Assign the number to a temporary variable
originalNumber = number;
// Count the number of digits
while (originalNumber != 0) {
originalNumber /= 10;
++n;
}
// Assign the number to the originalNumber variable
originalNumber = number;
// Calculate the sum of nth power of individual digits
while (originalNumber != 0) {
remainder = originalNumber % 10;
result += Math.pow(remainder, n);
originalNumber /= 10;
}
// Check if the result is equal to the original number
return result == number;
}
// Driver program
public static void main(String[] args) {
// Replace this value with the number you want to check
int number = 153;
// Call the function to check if the number is Armstrong
if (isArmstrong(number))
System.out.println(number + " is an Armstrong number.");
else
System.out.println(number + " is not an Armstrong number.");
}
}
π» Testing the Program
To test the program with different numbers, modify the value of number in the main program.
153 is an Armstrong number.
π§ How the Program Works
- The program defines a class ArmstrongNumber containing a static method isArmstrong that takes an integer number as input and checks whether it is an Armstrong number.
- Inside the main method, replace the value of number with the desired number you want to check.
- The program calls the isArmstrong method and prints the result.
π Between the Given Range
Let's dive into the Java code that checks for Armstrong numbers in the specified range.
public class ArmstrongNumbers {
// Function to check if a number is an Armstrong number
static boolean isArmstrong(int number) {
int originalNumber = number;
int numDigits = String.valueOf(number).length();
int sum = 0;
while (number != 0) {
int digit = number % 10;
sum += Math.pow(digit, numDigits);
number /= 10;
}
return sum == originalNumber;
}
// Driver program
public static void main(String[] args) {
System.out.println("Armstrong numbers in the range 1 to 50:");
for (int i = 1; i <= 50; i++) {
if (isArmstrong(i)) {
System.out.print(i + " ");
}
}
}
}
π» Testing the Program
Armstrong numbers in the range 1 to 50: 1 2 3 4 5 6 7 8 9
Simply compile and run the program. It will output the Armstrong numbers in the specified range.
π§ How the Program Works
- The program defines a class ArmstrongNumbers containing a static method isArmstrong that checks if a given number is an Armstrong number.
- Inside the method, it calculates the number of digits in the number and then iterates through each digit, summing up the digits each raised to the power of the number of digits.
- The main function tests the program by checking for Armstrong numbers in the range from 1 to 50 and printing the results.
π§ Understanding the Concept of Armstrong Number
Before delving into the code, let's understand the concept behind Armstrong numbers. An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits.
For example, 153 is an Armstrong number because 1^3 + 5^3 + 3^3 = 153.
π’ Optimizing the Program
While the provided program is straightforward, consider exploring and implementing alternative approaches or optimizations for checking Armstrong numbers.
Feel free to incorporate and modify this code as needed for your specific use case. Happy coding!
π¨βπ» Join our Community:
Author
For over eight years, I worked as a full-stack web developer. Now, I have chosen my profession as a full-time blogger at codetofun.com.
Buy me a coffee to make codetofun.com free for everyone.
Buy me a Coffee
If you have any doubts regarding this article (Java Program to Check Armstrong Number) please comment here. I will help you immediately.