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 vote242 views1 answer
Remove fragment from backstack
Java
0 vote242 views1 answer
How to use java
Java
0 vote260 views1 answer
Pop back stack fragment android
Java
1 vote264 views1 answer
Java double to fixed decimal
Java
0 vote264 views1 answer
Calendar check if month is 30 days
Java
1 vote283 views1 answer
CheckIndex Java
Java
0 vote253 views1 answer
A Queue after the following operations: enqueue(3) enqueue(4) enqueue(2) dequeue() enqueue(1) enqueue(1) enqueue(2) dequeue()
Java
0 vote266 views1 answer
Initialcontext tomcat bug
Java
15 votes237 views6 answers
String Concatenation
Java
0 vote270 views2 answers
How to create simple java bean class for login page in eclipse
Java