java find prime number code example

Example 1: java prime numbers

public class Main {
  public static void main(String[] args) {
    for (int i = 2; i < 1_000_000; ++i) {
      boolean isPrime = true;
      int sqrt = (int)Math.ceil(Math.sqrt(i));
      for (int divisor = 2; divisor <= sqrt; ++divisor) {
        if (i % divisor == 0) {
          isPrime = false;
          break;
        }
      }
      if (isPrime) {
        System.out.println(i);
      }
    }
  }
}

Example 2: prime number program in java

public class Prime {
    public static void main(String[] args) {

        int num = 29;
        boolean flag = false;
        for(int i = 2; i <= num/2; ++i){
            if(num % i == 0){
                flag = true;
                break;
            }
        }

        if (!flag)
            System.out.println(num + " is a prime number.");
        else
            System.out.println(num + " is not a prime number.");
}}

Example 3: how to check if number prime in java

public class PrimeNumberInJava
{
   public static void main(String[] args)
   {
      int a, b = 0, flag = 0;
      int number = 17;
      b = number / 2;
      if(number == 0 || number == 1)
      {
         System.out.println(number + " is not prime number");
      }
      else
      {
         for(a = 2; a <= b; a++)
         {
            if(number % a == 0)
            {
               System.out.println(number + " is not prime number.");
               flag = 1;
               break;
            }
         }
         if(flag == 0)
         {
            System.out.println(number + " is prime number.");
         }
      }
   }
}