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

5 votes105 views1 answer
Spigot title
Java
12 votes121 views5 answers
Java arraylist to array
Java
2 votes118 views2 answers
System vs integration testing
Java
3 votes110 views1 answer
Android clear specific sharedpreference value
Java
4 votes107 views1 answer
Creating random color in java
Java
1 vote108 views1 answer
Java list string package import
Java
1 vote130 views1 answer
Shakescleare merchant of venice
Java
0 vote111 views1 answer
Add space to the left and right sides of a cell
Java
0 vote107 views3 answers
Java stackoverflowerror
Java
1 vote112 views1 answer
Java contains password input
Java