import java.util.Scanner;
public class FindPrimeNumbers {
public static void main(String[] args) {
int digit;
boolean isPrimeNumber = true;
Scanner userInput = new Scanner(System.in);
System.out.println("Enter a digit to check that it is a prime number or not: ");
digit = userInput.nextInt();
for (int i = 2; i < digit; i++) {
if(digit % i == 0){
isPrimeNumber = false;
break;
}
}
if(isPrimeNumber){
System.out.println(digit+" is a prime number");
}else{
System.out.println(digit+" is not a prime number");
}
}
}
Output:
