Java Program to Check Disarium Number

Posted in Java Tutorial

Updated on Jan 11, 2024

By Mari Selvan

👁️ 36 - Views

⏳ 4 mins

💬 1 Comment

Photo Credit to CodeToFun

🙋 Introduction

In the realm of programming, exploring mathematical patterns is a fascinating endeavor. One such numeric pattern is the Disarium number.

A Disarium number is a number defined by the sum of its digits each raised to the power of its respective position.

In this tutorial, we'll delve into a Java program designed to check whether a given number is a Disarium number.

📄 Example

Let's explore the Java code that checks whether a given number is a Disarium number.

DisariumChecker.java

Copied

public class DisariumChecker {

// Function to count the number of digits in a given number
static int countDigits(int number) {
  int count = 0;
  while (number != 0) {
    count++;
    number /= 10;
  }
  return count;
}

// Function to check if a number is a Disarium number
static boolean isDisarium(int number) {
  int originalNumber = number;
  int digitCount = countDigits(number);
  int sum = 0;

  while (number != 0) {
    int digit = number % 10;
    sum += Math.pow(digit, digitCount);
    digitCount--;
    number /= 10;
  }

  return (sum == originalNumber);
}

// Driver program
public static void main(String[] args) {
  // Replace this value with your desired number
  int inputNumber = 89;

  // Check if the number is Disarium
  if (isDisarium(inputNumber)) {
    System.out.println(inputNumber + " is a Disarium number.");
  } else {
    System.out.println(inputNumber + " is not a Disarium number.");
  }
}
}

💻 Testing the Program

To test the program with different numbers, replace the value of inputNumber in the main method.

Output

89 is a Disarium number.

Compile and run the program to check if the number is a Disarium number.

🧠 How the Program Works

The program defines a class DisariumChecker containing static methods to count the number of digits and check if a number is a Disarium number.
The isDisarium method checks if a number is a Disarium number by summing the digits each raised to the power of its position.
The main method tests the isDisarium method with a sample number (replace it with your desired number).

📏 Between the Given Range

Let's dive into the Java code that checks for Disarium numbers in the specified range.

DisariumChecker.java

Copied

public class DisariumChecker {

  // Function to check if a number is a Disarium number
  static boolean isDisarium(int number) {
    int originalNumber = number;
    int sum = 0;
    int position = 1;

    while (number > 0) {
      int digit = number % 10;
      sum += Math.pow(digit, position);
      number /= 10;
      position++;
    }

    return sum == originalNumber;
  }

  // Driver program
  public static void main(String[] args) {
    System.out.print("Disarium numbers in the range 1 to 100: ");

    for (int i = 1; i <= 100; i++) {
      if (isDisarium(i)) {
        System.out.print(i + " ");
      }
    }
  }
}

💻 Testing the Program

Output

Disarium numbers in the range 1 to 100:
1 2 3 4 5 6 7 8 9 89

Simply compile and run the program to see the Disarium numbers in the specified range.

🧠 How the Program Works

The program defines a class DisariumChecker containing a static method isDisarium that checks if a number is a Disarium number.
Inside the method, it iterates through each digit of the number, raising it to the power of its respective position and accumulating the sum.
The main function tests the Disarium check for numbers in the range from 1 to 100 and prints the Disarium numbers.