package Maths;

import java.util.Scanner;

public class PrimeCheck {

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

System.out.println("Enter n:");

int n = scanner.nextInt();

if (isPrime(n)) {

System.out.println(n + "is prime number");

} else {

System.out.println(n + "is not prime number");

}

}

/***

* Check a number is prime or not

* @param n the number

* @return {@code true} if {@code n} is prime

*/

public static boolean isPrime(int n) {

for (int i = 3; i <= Math.sqrt(n); i += 2) {

if (n % i == 0) {

return false;

}

}

return true;

}

}