Adam Number in Java

In this section, we will learn what is an Adam number and also create Java programs to check if the given number is Adam or not. The Adam number program frequently asked in Java coding tests and academics.

Adam Number

A number is called an Adam number if the square of a number and the square of its reverse are reverse to each other. Let’s understand it through an example.

Adam Number Example

Consider a number (N) 12 and check it is an Adam number or not.

Square of the number (N) = 144

The reverse of the number (N) = 21

Square of the reverse of the number (N) = 441

We observe that the square of 12 and the square of its reverse i.e. 21 are reverse of each other. Hence, 12 is an Adam number.

Some other Adam numbers are 0, 1, 2, 3, 11, 12, 13, 21, 22, 31, 101, 102, 103, 111, etc.

Steps to Find Adam Number

Read or initialize a number N.
Find the square of the number.
Find the reverse of the square.
Reverse the number N.
Find the square of the reversed number.
If the reverse of the square of the number is equal to the square of the reverse of the number, the number is an Adam number, else not.

Let’s implement the above steps in a Java program.

Adam Number Java Program

AdamNumberExample1.java

  import java.util.Scanner;  public class AdamNumberExample  {  //function that finds the reverse of the number  static int reverseDigits(int num)  {  //stores the reverse number      int rev = 0;  //executes until the condition becomes false  while (num > 0)  {  //finds the last digit of the given number and add it to the variable rev  rev = rev * 10 + num % 10;  num = num / 10;  }  //returns the reverse number  return rev;  }  //function that finds the square of the number  static int square(int num)  {  //returns the square      return (num * num);  }  //function that checks if the number is Adam or not  static boolean isAdamNumber(int num)  {  // Square first number and square  // reverse digits of second number  int a = square(num);  int b = square(reverseDigits(num));  // If reverse of b equals a then given  // number is Adam number  //if the square of the number is equal to the square of reverse of the number  if (a == reverseDigits(b))  //returns true if the number is an Adam number  return true;  //returns false if the number is not an Adam number  return false;  }  //driver code  public static void main(String args[])  {  Scanner sc = new Scanner(System.in);  System.out.print(“Enter the number: “);  //reads an integer   int num = sc.nextInt();  if (isAdamNumber(num))  System.out.println(num+ ” is an Adam number.”);  else  System.out.println(num+ ” not an Adam number.”);  }  }  

Output 1:

Enter the number: 301  301 is an Adam number.

Output 2:

Enter the number: 276  276 is not an Adam number.

Let’s create another Java program and find all the prime Adam numbers between the given range.

PrimeAdamExample.java

  import java.util.Scanner;  public class PrimeAdamExample  {  //function that finds the reverse of the given number      public static int reverse(int num)   {  int rev = 0;  //executes until the condition becomes false  while (num != 0)   {  //finds the last digit of the given number  int d = num % 10;  //adds the last digit in the variable rev  rev = rev * 10 + d;  //removes the last digit  num = num / 10;  }  //returns the reverse of the given number  return rev;  }  //function check if the number is Adam or not  public static boolean isAdam(int num)   {  //finds the square of the num      int sqNum = num * num;  //calling the user-defined function that finds the reverse of the number  int revNum = reverse(num);  //find the square of the reverse number  int sqRevNum = revNum * revNum;  //reverse the square of the number  int rev = reverse(sqNum);  //compares the reverse of the number with the reverse of square of the number  return rev == sqRevNum;  }  //function checks if the number Adam number is prime or not  public static boolean isPrime(int num)   {  int c = 0;  for (int i = 1; i <= num; i++)   {  if (num % i == 0)   {  c++;  }  }  return c == 2;  }  //driver code  public static void main(String args[])   {  Scanner in = new Scanner(System.in);  System.out.print(“Enter the lower limit: “);  int m = in.nextInt();  System.out.print(“Enter the upper limit: “);  int n = in.nextInt();  int count = 0;  if (m >= n)   {  System.out.println(“Enter valid input! the value of m should be greater than or equal to n.”);  return;  }  System.out.println(“The prime Adam numbers are:”);  //prints all the Adam number between given range  for (int i = m; i <= n; i++)   {  boolean adam = isAdam(i);  if (adam)   {  boolean prime = isPrime(i);  if (prime)   {  System.out.print(i + ” “);  count++;  }  }  }  if (count == 0)   {  System.out.print(“NIL”);  }  System.out.println();  System.out.println(“Frequency of Adam number is: ” + count);  }  }  

Output:

Enter the lower limit: 0  Enter the upper limit: 1000  The prime Adam numbers are:  2 3 11 13 31 101 103 113 211 311   Frequency of Adam number is: 10

Next TopicBell Number in Java

Adam Number in Java

Adam Number in Java

Adam Number

Adam Number Example

Steps to Find Adam Number

Adam Number Java Program

Java ObjectInputStream readUnsingedByte() Method with Examples

Java Connection

You may also like