java prime numbers from 1 to 100 code example

Example 1: java prime numbers 1 to 1000000

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 prime numbers from 1 to 100

public class Main {
  public static void main(String[] args) {
    for (int i = 2; i < 100; ++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 3: java program to find prime number between 1 and 100

class PrimeNumbers
{
   public static void main (String[] args)
   {		
       int i =0;
       int num =0;
       //Empty String
       String  primeNumbers = "";

       for (i = 1; i <= 100; i++)         
       { 		  	  
          int counter=0; 	  
          for(num =i; num>=1; num--)
	  {
             if(i%num==0)
	     {
 		counter = counter + 1;
	     }
	  }
	  if (counter ==2)
	  {
	     //Appended the Prime number to the String
	     primeNumbers = primeNumbers + i + " ";
	  }	
       }	
       System.out.println("Prime numbers from 1 to 100 are :");
       System.out.println(primeNumbers);
   }
}

Example 4: Java program to display prime numbers from 1 to 100

public class PrimeNumbersFrom1To100
{
   public static void main(String[] args)
   {
      int maxNumber = 100;
      boolean prime = true;
      String primeNumbers = "";
      for(int a = 1; a <= maxNumber; a++)
      {
         prime = checkPrime(a);
         if(prime)
         {
            primeNumbers = primeNumbers + a + " ";
         }
      }
      System.out.println("Display prime numbers from 1 to " + maxNumber + ": ");
      System.out.println(primeNumbers);
   }
   public static boolean checkPrime(int number)
   {
      int remainder;
      for(int a = 2; a <= number / 2; a++)
      {
         remainder = number % a;
         // if remainder is equal to 0 then number is not prime
         if(remainder == 0)
         {
            return false;
         }
      }
      return true;
   }
}