mport java.util.*;
public class PrimeNumbers {
boolean isPrime(int n)
        {
 boolean b=true;
 for(int i=2;i<=n/2;i++)
 {
     if(n%i==0)
     {
         b=false;
         break;

     }
 }
 return b;
}
public static void main(String args[])
{
    Scanner src=new Scanner(System.in);
    System.out.println("Enter a number");
    int n=src.nextInt();
    PrimeNumbers p=new PrimeNumbers();
   System.out.println(p.isPrime(n));
   int z=1;
   for(int i=2;z<=10;i++)
       {
           if(p.isPrime(i))
           {
               z++;
               System.out.println(i);
           }
       }
   }
}


Output:-

Enter a number
34
false
2
3
5
7
11
13
17
19
23
29
