public class Prime { { int numPrimes = 0; int currentTest = 2; int isPrime = 1; while (numPrimes<10000) { for (int i = 2; i < currentTest-1; i++) { if (currentTest%i == 0){ isPrime = 0; break; } } if (isPrime == 1) { numPrimes = numPrimes + 1; } isPrime = 1; currentTest = currentTest + 1; } } }