In this program, you'll learn to display all armstrong numbers between two given intervals, low and high, in Java.

A positive integer is called an Armstrong number of order `n` if

abcd... = a^{n}+ b^{n}+ c^{n}+ d^{n}+ ...

In case of an Armstrong number of 3 digits, the sum of cubes of each digits is equal to the number itself. For example:

153 = 1*1*1 + 5*5*5 + 3*3*3 // 153 is an Armstrong number.

This program is built on the concept of how to check whether an integer is an Armstrong number or not.

```
public class Armstrong {
public static void main(String[] args) {
int low = 999, high = 99999;
for(int number = low + 1; number < high; ++number) {
int digits = 0;
int result = 0;
int originalNumber = number;
// number of digits calculation
while (originalNumber != 0) {
originalNumber /= 10;
++digits;
}
originalNumber = number;
// result contains sum of nth power of its digits
while (originalNumber != 0) {
int remainder = originalNumber % 10;
result += Math.pow(remainder, digits);
originalNumber /= 10;
}
if (result == number)
System.out.print(number + " ");
}
}
}
```

When you run the program, the output will be:

1634 8208 9474 54748 92727 93084

In the above program, each number between the given interval high and low are checked.

After each check, number of `digits` and sum `result` are restored to 0.

It takes a lot of effort and cost to maintain Programiz. We would be grateful if you support us by either:

**Disabling AdBlock on Programiz. We do not use intrusive ads.**

or

Donate on Paypal