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 vote175 views1 answer
Caused by: java.sql.sqlexception: no database selected
Java
1 vote146 views3 answers
Print list in java 8
Java
32 votes139 views2 answers
Check jdk version windows 10 cmd
Java
-1 vote198 views1 answer
Spring jpa query with union all
Java
0 vote188 views1 answer
Code for fibonacci numbers using For loop in Java
Java
1 vote143 views1 answer
Java 8 filter first
Java
2 votes144 views1 answer
Loop hash map
Java
3 votes143 views1 answer
How to change font
Java
0 vote148 views1 answer
How to change the color of a drawable programmically
Java
0 vote178 views1 answer
Fibonacci numbers using Recursion in Java
Java