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 vote352 views1 answer
Java to check if its a number scanner
Java
13 votes437 views1 answer
Java find time between two dates
Java
51 votes370 views6 answers
Java remove last character
Java
3 votes337 views4 answers
How to make JFrame full screen
Java
0 vote356 views1 answer
Lists - removing with iterator
Java
0 vote351 views1 answer
Java Tiempo transcurrido entre fechas y horas
Java
0 vote416 views1 answer
How to write a perfect shuffle method in java
Java
9 votes342 views5 answers
String remove duplicate method in java
Java
1 vote322 views1 answer
Java swing array of buttons
Java
1 vote371 views1 answer
Transformez integer en string
Java