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 vote346 views1 answer
Distance point to line java
Java
2 votes348 views2 answers
Even Digits Leetcode
Java
0 vote348 views1 answer
Protobuf java gradle mvn
Java
1 vote337 views1 answer
Do you have to implement all methods of an interface java
Java
0 vote330 views1 answer
Java string split from input string
Java
0 vote317 views1 answer
BufferredReader Class
Java
0 vote361 views1 answer
Bundle in java
Java
0 vote380 views1 answer
Java replace all space with underscore
Java
1 vote370 views1 answer
Calendar.year java
Java
0 vote362 views1 answer
Aws s3 compatible java
Java