Question

Java two dimensional arrays

Create a method named curiousNumber that takes an integer named num as a parameter and returns a boolean. You can assume the num will be a positive integer.

The curiousNumber method should determine whether num is a curious number. A curious number is a number that is equal to the sum of the factorial of each of its digits. For example, 145 is a curious number because 145 = 1! + 4! + 5!.

sample:

boolean b1 = curiousNumber(145);      return value true

boolean b2 = curiousNumber(18);        return value false

Answer 1

public class CuriousNumber {

    public static boolean curiousNumber(int n) {
        int sum = 0, original = n;
        while (n > 0) {
            int d = n % 10;
            n /= 10;
            int f = 1;
            for (int i = 1; i <= d; i++) {
                f *= i;
            }
            sum += f;
        }
        return sum == original;
    }

    public static void main(String[] args) {
        System.out.println(curiousNumber(145));
        System.out.println(curiousNumber(18));
    }
}