Java Basic
Java Interview Programs
- Java Interview Programs
- Java Abundant Number
- Java Amicable Number
- Java Armstrong Number
- Java Average of N Numbers
- Java Automorphic Number
- Java Biggest of three numbers
- Java Binary to Decimal
- Java Common Divisors
- Java Composite Number
- Java Condense a Number
- Java Cube Number
- Java Decimal to Binary
- Java Decimal to Octal
- Java Disarium Number
- Java Even Number
- Java Evil Number
- Java Factorial of a Number
- Java Fibonacci Series
- Java GCD
- Java Happy Number
- Java Harshad Number
- Java LCM
- Java Leap Year
- Java Magic Number
- Java Matrix Addition
- Java Matrix Division
- Java Matrix Multiplication
- Java Matrix Subtraction
- JS Matrix Transpose
- Java Maximum Value of an Array
- Java Minimum Value of an Array
- Java Multiplication Table
- Java Natural Number
- Java Number Combination
- Java Odd Number
- Java Palindrome Number
- Java Pascalβs Triangle
- Java Perfect Number
- Java Perfect Square
- Java Power of 2
- Java Power of 3
- Java Pronic Number
- Java Prime Factor
- Java Prime Number
- Java Smith Number
- Java Strong Number
- Java Sum of Array
- Java Sum of Digits
- Java Swap Two Numbers
- Java Triangular Number
Java Program to Check Automorphic Number
Photo Credit to CodeToFun
π Introduction
In the realm of Java programming, exploring unique number properties is both fascinating and educational. An automorphic number is one such interesting concept.
An automorphic number (or circular number) is a number whose square ends with the number itself. In simpler terms, an n-digit number is called an automorphic number if the last n digits of its square are equal to the number itself.
In this tutorial, we'll delve into a Java program that checks whether a given number is an automorphic number or not.
The program will take a number as input, square it, and then compare the last digits to determine if it meets the criteria of an automorphic number.
π Example
Let's explore the Java code that accomplishes this task.
public class AutomorphicNumber {
// Function to check if a number is automorphic
static boolean isAutomorphic(int num) {
// Calculate the square of the number
long square = (long) num * num;
// Count the number of digits in the original number
int originalDigits = 0;
int temp = num;
while (temp != 0) {
temp /= 10;
originalDigits++;
}
// Extract the last digits from the square
long lastDigits = square % (long) Math.pow(10, originalDigits);
// Check if the last digits match the original number
return lastDigits == num;
}
// Driver program
public static void main(String[] args) {
// Replace this value with your desired number
int number = 76;
// Check if the number is automorphic
if (isAutomorphic(number)) {
System.out.println(number + " is an automorphic number.");
} else {
System.out.println(number + " is not an automorphic number.");
}
}
}
π» Testing the Program
To test the program with different numbers, simply replace the value of number in the main method.
76 is an automorphic number.
Compile and run the program to check if the given number is an automorphic number.
π§ How the Program Works
- The program defines a class AutomorphicNumber containing a static method isAutomorphic that takes a number as input and returns whether it is an automorphic number or not.
- Inside the method, it calculates the square of the input number.
- It counts the number of digits in the original number to extract the corresponding number of last digits from the square.
- It compares the extracted last digits with the original number to determine if it's an automorphic number.
π Between the Given Range
Let's explore the Java code that checks for Automorphic Numbers in the specified range.
public class AutomorphicChecker {
// Function to check if a number is Automorphic
static boolean isAutomorphic(int num) {
int square = num * num;
String numStr = String.valueOf(num);
String squareStr = String.valueOf(square);
return squareStr.endsWith(numStr);
}
// Driver program
public static void main(String[] args) {
System.out.println("Automorphic Numbers in the range 1 to 50:");
for (int i = 1; i <= 50; i++) {
if (isAutomorphic(i)) {
System.out.print(i + " ");
}
}
}
}
π» Testing the Program
Automorphic Numbers in the range 1 to 50: 1 5 6 25
The provided program is set to check for Automorphic Numbers within the range of 1 to 50. Run the program to see the Automorphic Numbers in this specific range.
π§ How the Program Works
- The program defines a class AutomorphicChecker containing a static method isAutomorphic that checks if a given number is Automorphic.
- Inside the method, it calculates the square of the number and converts both the number and its square to strings.
- It checks if the square's string representation ends with the number's string representation.
- The main function tests and prints Automorphic Numbers in the range of 1 to 50.
π§ Understanding the Concept of Automorphic Numbers
Before delving into the code, let's take a moment to understand automorphic numbers.
An n-digit number is called an automorphic number if the last n digits of its square are equal to the number itself.
For example, 25 is an automorphic number because its square is 625, and the last two digits (25) match the original number.
π’ Optimizing the Program
While the provided program effectively checks for automorphic numbers, you can explore and implement further optimizations or variations based on your specific needs or preferences.
Feel free to incorporate and modify this code as needed for your specific use case. Happy coding!
π¨βπ» Join our Community:
Author
For over eight years, I worked as a full-stack web developer. Now, I have chosen my profession as a full-time blogger at codetofun.com.
Buy me a coffee to make codetofun.com free for everyone.
Buy me a Coffee
If you have any doubts regarding this article (Java Program to Check Automorphic Number), please comment here. I will help you immediately.