-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPrimeNumberChecker.java
39 lines (31 loc) · 966 Bytes
/
PrimeNumberChecker.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
import java.util.Scanner;
class PrimeNumberChecker {
//Main method
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = input.nextInt();
// Method to check if a given number is prime
boolean isPrime = isPrime(number);
// Display result
if(isPrime) {
System.out.println(number + " is a prime number");
} else {
System.out.println(number + " is not a prime number");
}
input.close();
}
// Method to check if a given number is prime
public static boolean isPrime(int number) {
if(number <= 1) {
return false;
}
// loop from 2 to square root of number
for(int i = 2; i <= Math.sqrt(number); i++) {
if(number % i == 0) {
return false;
}
}
return true;
}
}