Automorphic number in java

Given an integer input, the Objective is to check whether the square of the number ends with the same number or not.

import java.util.*;

class HelloWorld {

    public static void main(String[] args) {

        int n=sc.nextInt();

        int square=(int)Math.pow(n,2);

        System.out.print(square%10==n?"yes":"no");

    }

}

This program determines if a given integer $n$ satisfies the condition where the last digit of its square equals the number itself.

For example:

• Input: $n = 5$
  • Square = $5^2 = 25$
  • Last digit = $5$
  • Output = Yes
• Input: $n = 7$
• Square = $7^2 = 49$
• Last digit ≠ $7$
• Output = N0

How It Works

1. Input:
   The program reads an integer $n$.

2. Calculate the Square:
   Use $Math.pow(n, 2)$ to compute the square of $n$.
   Explicitly cast the result to int since $Math.pow$ returns a double.

3. Check the Last Digit:
   Use the modulus operator (%) to extract the last digit of the square.
   Compare this last digit with $n$.

4. Output:
   Print "Yes" if the last digit of the square equals $n$, otherwise print "No."

---

Example Input and Output

Example 1
Input:
5
Process:

• $5^2 = 25$
• Last digit = $25 \mod 10 = 5$
• $5 = 5$

Output:
Yes, the square of 5 ends with 5

---

Example 2
Input:
7
Process:

• $7^2 = 49$
• Last digit = $49 \mod 10 = 9$
• $7 \neq 9$

Output:
No, the square of 7 does not end with 7

---

Edge Cases

1. Single-digit Numbers:
   All single-digit numbers are directly checked for their properties.

2. Zero:
   Input = $0$, Square = $0$, Output = Yes (since $0$ ends with $0$).