print n number of 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 from 2 to n

// Java program to print prime numbers from 2 to n
import java.util.Scanner;
public class PrimeNumberFrom2Ton
{
   public static void main(String[] args) 
   {
      int loop, max;
      System.out.print("Please enter highest (maximum) number: ");
      Scanner sc = new Scanner(System.in);
      max = sc.nextInt();
      for(loop = 2; loop < max; ++loop)
      {
         if(findPrime(loop))
         {
            System.out.println(loop);
         }
      }
      sc.close();
   }
   public static boolean findPrime(int number)
   {
      int a;
      boolean boolPrime = true;
      for(a = 2; a < number / 2; a++)
      {
         if(number%a == 0)
         {
            boolPrime = false;
            break;
         }
      }
      return boolPrime;
   }
}