Java/checkPrime.java at master · Akshen22/Java · GitHub

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
importjava.util.Scanner;

/**
 *
 * @author Vidhikara
 */
publicclasscheckPrime {

publicstaticvoidmain(String[] args) {
Scannerscn=newScanner(System.in);
intn=scn.nextInt();
if(n<2){
System.out.println("Not a prime!! ");
scn.close();
return;
 }
for(inti=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();
 }

}
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
importjava.util.Scanner;

/**
 *
 * @author Vidhikara
 */
publicclasscheckPrime {

publicstaticvoidmain(String[] args) {
Scannerscn=newScanner(System.in);
intn=scn.nextInt();
if(n<2){
System.out.println("Not a prime!! ");
scn.close();
return;
 }
for(inti=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();
 }

}
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
importjava.util.Scanner;

/**
 *
 * @author Vidhikara
 */
publicclasscheckPrime {

publicstaticvoidmain(String[] args) {
Scannerscn=newScanner(System.in);
intn=scn.nextInt();
if(n<2){
System.out.println("Not a prime!! ");
scn.close();
return;
 }
for(inti=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();
 }

}
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
importjava.util.Scanner;

/**
 *
 * @author Vidhikara
 */
publicclasscheckPrime {

publicstaticvoidmain(String[] args) {
Scannerscn=newScanner(System.in);
intn=scn.nextInt();
if(n<2){
System.out.println("Not a prime!! ");
scn.close();
return;
 }
for(inti=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();
 }

}
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
importjava.util.Scanner;

/**
 *
 * @author Vidhikara
 */
publicclasscheckPrime {

publicstaticvoidmain(String[] args) {
Scannerscn=newScanner(System.in);
intn=scn.nextInt();
if(n<2){
System.out.println("Not a prime!! ");
scn.close();
return;
 }
for(inti=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();
 }

}
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
importjava.util.Scanner;

/**
 *
 * @author Vidhikara
 */
publicclasscheckPrime {

publicstaticvoidmain(String[] args) {
Scannerscn=newScanner(System.in);
intn=scn.nextInt();
if(n<2){
System.out.println("Not a prime!! ");
scn.close();
return;
 }
for(inti=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();
 }

}
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
importjava.util.Scanner;

/**
 *
 * @author Vidhikara
 */
publicclasscheckPrime {

publicstaticvoidmain(String[] args) {
Scannerscn=newScanner(System.in);
intn=scn.nextInt();
if(n<2){
System.out.println("Not a prime!! ");
scn.close();
return;
 }
for(inti=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();
 }

}
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
importjava.util.Scanner;

/**
 *
 * @author Vidhikara
 */
publicclasscheckPrime {

publicstaticvoidmain(String[] args) {
Scannerscn=newScanner(System.in);
intn=scn.nextInt();
if(n<2){
System.out.println("Not a prime!! ");
scn.close();
return;
 }
for(inti=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();
 }

}