Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
29 lines (23 loc) · 651 Bytes

File metadata and controls

29 lines (23 loc) · 651 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
import java.util.*;
public class CheckPrime{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("enter a number");
int n = sc.nextInt();
boolean isprime = true;
for(int i=2; i*i<=n;i++){
if(n%i==0){
isprime = false;
break;
}
}
if(n<2){
isprime = false;
}
if(isprime==false){
System.out.print(n+" is not a Prime Number");
}else{
System.out.print(n+" is a Prime Number");
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.