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 vote145 views1 answer
Convert hashset to arraylist
Java
3 votes224 views3 answers
Spring mvc
Java
22 votes218 views2 answers
Java quit application
Java
-2 votes195 views2 answers
Https://www.roblox.com/home
Java
1 vote189 views1 answer
Final method meaning
Java
0 vote213 views1 answer
Javafx how to get the selected index of the seleceted elment in listview
Java
0 vote128 views1 answer
Double.min in java
Java
13 votes217 views2 answers
For loop in java example complete programs
Java
0 vote210 views1 answer
How to remove backstack fragment
Java
4 votes306 views3 answers
Java package
Java