-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main.java
35 lines (27 loc) · 900 Bytes
/
Main.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
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Prompt user for number
System.out.print("Enter a number: ");
int number = scanner.nextInt();
scanner.close();
// Check if the number is prime
boolean isPrime = isPrimeNumber(number);
// Print the result
System.out.println(number + (isPrime ? " is prime." : " is not prime."));
}
public static boolean isPrimeNumber(int number) {
// Base cases
if (number <= 1) {
return false;
}
// Check if the number is divisible by any number less than or equal to its square root
for (int i = 2; i <= Math.sqrt(number); i++) {
if (number % i == 0) {
return false;
}
}
return true;
}
}