Home|About|Gaming cabinet|Archives|How it works|Starter sites

GeezerVison is showing github.com — Java-Programs/Basic-Programs/checkPrime.java at master · divScorp/Java-Programs

Expand file tree

/

checkPrime.java

Copy path

More file actions

More file actions

Latest commit

History

History

29 lines (25 loc) · 638 Bytes

/

checkPrime.java

Copy path

File metadata and controls

29 lines (25 loc) · 638 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.Scanner;

/**

*

* @author Vidhikara

*/

public class checkPrime {

public static void main(String[] args) {

Scanner scn=new Scanner(System.in);

int n=scn.nextInt();

if(n<2){

System.out.println("Not a prime!! ");

scn.close();

return;

}

for(int i=2;i<=n/2;i++){

if(n%i==0){

System.out.println("Not a prime!! ");

scn.close();

return;

}

}

System.out.println("Number is Prime!! ");

scn.close();

}

}