AP Computer Science - The Armstrong Numbers

hansenator(57)

Published in

#tutorials

Words

0

Reading

0 min

Listen

Play

2018-02-01 04:10

An Armstrong number is defined to be an integer where the sum each digit raised to the power of the number of digits in the number equals the number itself. Haha. Sound confusing? Well here is are two examples:

My program to find these numbers:

Surprisingly this only took 53 lines of code... It can be done in less.

The output:

Here are all Armstrong numbers from 1 to 100,000
1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474, 54748, 92727, 93084

If you want to try out the raw code yourself you can go to browxy.com or codiva.io and copy/paste this:

class Armstrong {
// This is the main class. It runs the program.
public static void main(String[] args) {
AllArmstrongNumbers(1,100000);
}
// This prints out all Armstrong numbers from 1st to 2nd argument.
public static void AllArmstrongNumbers(int min, int max) {
boolean ANum;
for (int i = min; i <= max; i) {
ANum = isArmstrong(i);
if (ANum == true) {System.out.print(i + " ");}
}
}
// This counts the number of digits in a number.
public static int digitCount(int n) {
int count = 0;
while(n != 0) {
n = n / 10;
count;
}
return count;
}
// This is an exponent calculator.
public static int power(int base, int exponent) {
int summ = base;
for(int i = 1; i < exponent; i){
summ = summ*base;
}
return summ;
}
// This finds out if a number is Armstrong.
public static boolean isArmstrong(int num) {
int remainder;
int exp = digitCount(num);
int originalNumber = num;
boolean ArmstrongNumber;
int summ = 0;
for (int i = 1; i <= exp; i) {
remainder = num % 10;
summ = summ + power(remainder,exp);
num = num / 10;
}
if (summ == originalNumber) {ArmstrongNumber = true;}
else {ArmstrongNumber = false;}
return ArmstrongNumber;
}
}