PrimeNumberChecker/PrimeryNumberChecker.java at main · alex4axp/PrimeNumberChecker · 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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

package primerynumberchecker;
import java.util.Scanner;

public class PrimeryNumberChecker {


    public static void main(String[] args) {
    Scanner inp=new Scanner(System.in);
    int n,x;
        System.out.println("Enter the number to check if its primary or not ");
        n=inp.nextInt();
        boolean isPrim=true;
        if(n<=1){
            System.out.println("the number is not primery");

        }
        else{
        for(int i=2;i<=Math.sqrt(n);i++){

         x=n%i;
         if(x==0){

         isPrim=false;

         }


        }

        if (isPrim){
            System.out.println("the number is primary");


        }
        else{
            System.out.println("the number is not primary");


        }

        }


    }

}