program to print prime numbers in java 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: Java program to print prime numbers upto n

// Java program to print prime numbers upto n
import java.util.Scanner;
public class PrimeNumberUptoN
{
   public static void main(String[] args)
   {
      Scanner sc = new Scanner(System.in);
      int a = 0;
      int n = 0;
      String strPrime = "";
      System.out.println("Please enter the value of n: ");
      int number = sc.nextInt();
      for(a = 1; a <= number; a++)
      {
         int counter = 0;
         for(n = a; n >= 1; n--)
         {
            if(a % n == 0)
            {
               counter = counter + 1;
            }
         }
         if(counter == 2)
         {
            strPrime = strPrime + a + " ";
         }
      }
      System.out.println("prime numbers upto n are: ");
      System.out.println(strPrime);
      sc.close();
   }
}

Example 3: making list of prime numbers java

Now let’s see print first 10 prime numbers in java.

public class FirstTenPrimeNumbers
{
   public static void main(String[] args) 
   {
      int count = 0, number = 0, a = 1, b = 1;  
      while(number < 10)  
      {  
         b = 1;  
         count = 0;  
         while(b <= a)  
         {  
            if(a%b == 0)  
                count++;  
            b++;
         }  
         if(count == 2)  
         {  
            System.out.printf("%d ", a);  
            number++;  
         }  
         a++;  
      }
   }
}

Example 4: prime number 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.");
}}