how to find prime numbers in n in java code example

Example 1: 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 2: checking if a given integer is a 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)
        {
            // condition for nonprime number
            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.");
    }
}