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

-1 vote161 views1 answer
Java get classpath
Java
1 vote142 views1 answer
Final double in java
Java
0 vote156 views1 answer
Spring security avec spring version 2.5.6
Java
0 vote161 views1 answer
How to draw
Java
-3 votes157 views2 answers
Multiplication Table in java
Java
0 vote193 views1 answer
Spring org.springframework.stereotype not visible
Java
0 vote204 views1 answer
Java main setup
Java
0 vote168 views1 answer
Java quote of the day
Java
0 vote203 views4 answers
How to stop extending jpa repository to every class in java
Java
0 vote197 views1 answer
Long in java
Java