package com.javabasic.primenumbergenration; public class PrimeNumberGenration { public static void main(String[] args) { int max = 100; System.out.println("prime numbers from 2 to 100 is.."); for (int i = 2; i < max; i++) { boolean isPrimeNumber = true; for (int j = 2; j < i; j++) { if (i % j == 0) { isPrimeNumber = false; break; } } if (isPrimeNumber) { System.out.print(i + " "); } } } }output prime numbers from 2 to 100 is 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
    
   
    
    
    
		
  
  
  
   
![endif]-->