How to find prime numbers in java

public class PrimeExample2{    

  static void checkPrime(int n){  
    int i,m=0,flag=0;      
    m=n/2;      
    if(n==0||n==1){  
     System.out.println(n+" is not prime number");      
    }else{  
       for(i=2;i<=m;i++){      
        if(n%i==0){      
         System.out.println(n+" is not prime number");      
         flag=1;      
         break;      
      }      
     }      
     if(flag==0)  { System.out.println(n+" is prime number"); }  
    }//end of else  
  }  
 public static void main(String args[]){    
  checkPrime(1);  
  checkPrime(3);  
  checkPrime(17);  
  checkPrime(20);  
}    
}

Similar codes

0 vote254 views1 answer
Fakultät in java
Java
0 vote154 views2 answers
Findby(xpath selenium java)
Java
0 vote165 views1 answer
Labelled break statement in Java
Java
0 vote185 views1 answer
Rotate vector 3d java
Java
0 vote153 views1 answer
Java console readline null pointer exception
Java
1 vote194 views1 answer
Shutdown batch file windows 10
Java
0 vote127 views1 answer
Processing java screen wrap
Java
0 vote195 views1 answer
Java sin-1
Java
1 vote110 views1 answer
System.out.println giving error syntax error on token ".", @ expected after this token
Java
1 vote176 views1 answer
Murtaza jafari
Java