on
java
- Get link
- X
- Other Apps
import java.util.Scanner;
public class PrimeNumber {
public static void main(String[] args) {
int userNumber;
int noOfFactor = 0;
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a whole number : ");
userNumber = scanner.nextInt();
scanner.close();
if (userNumber == 1) {
System.out.println("1 is not a prime number.");
} else if (userNumber < 1) {
System.out.println("Please enter a whole number.");
} else {
for (int i = 1; i <= userNumber; i++) {
if (userNumber % i == 0) {
noOfFactor++;
}
}
if (noOfFactor == 2) {
// number have only two factors
System.out.println("It is a prime number.");
} else {
// number have more than two factors
System.out.println("It is not a prime number.");
}
}
}
}
Output:
Enter a whole number : 3
It is a prime number.
Hope you understood how to verify whether the number is a prime number or not. If you still have any doubts then please let me know in the comment.
Comments
Post a Comment