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 vote296 views1 answer
Java map sorted by key
Java
57 votes293 views3 answers
Java print array as string
Java
0 vote319 views1 answer
How to split string with dolor sign in java
Java
0 vote332 views1 answer
Java join if string is empty delimiter not used
Java
0 vote261 views5 answers
Deal with empty or blank cell in excel file using apache poi
Java
4 votes313 views3 answers
Array find max in java
Java
0 vote320 views2 answers
Calculate smallest angle difference
Java
0 vote351 views1 answer
Java compile
Java
0 vote289 views1 answer
Matrix multiplication javascrpt
Java
1 vote297 views1 answer
Java check if int is null
Java