1 public class Print {
 2     private static final int MAXPRIMES = 100;
 3     /******************************************************* 
 4      * Finds and prints n prime integers 
 5      * Jeff Offutt, Spring 2003 
 6      ******************************************************/ 
 7     public static void printPrimes (int n) 
 8     { 
 9         int curPrime; // Value currently considered for primeness 
10         int numPrimes; // Number of primes found so far. 
11         boolean isPrime; // Is curPrime prime? 
12         int [] primes = new int [MAXPRIMES]; // The list of prime numbers. 
13         
14         // Initialize 2 into the list of primes. 
15         primes [0] = 2; 
16         numPrimes = 1; 
17         curPrime = 2; 
18         while (numPrimes < n) 
19         { 
20             curPrime++; // next number to consider ... 
21             isPrime = true; 
22             for (int i = 0; i <= numPrimes-1; i++) 
23             { // for each previous prime. 
24                 if (isDivisable(primes[i],curPrime)) 
25                 { // Found a divisor, curPrime is not prime. 
26                     isPrime = false; 
27                     break; // out of loop through primes. 
28                 } 
29             } 
30             if (isPrime) 
31             { // save it! 
32                 primes[numPrimes] = curPrime; 
33                 numPrimes++; 
34             } 
35         } // End while 
36         
37         // Print all the primes out. 
38         for (int i = 0; i <= numPrimes-1; i++) 
39         { 
40             System.out.println ("Prime: " + primes[i]); 
41         } 
42     } // end printPrimes
43     }