public class FindPrime {
public static void main(String[] args) {
int count = 0; // Counter for prime numbers
int number = 1; // Number to check for primality
int target = 100001; // Target prime number position
while (count < target) {
number++;
if (isPrime(number)) {
count++;
}
}
System.out.println("The 100,001st prime number is: " + number);
}
// Method to check if a number is prime
public static boolean isPrime(int num) {
if (num < 2) return false;
for (int i = 2; i <= Math.sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
}
/*
run:
The 100,001st prime number is: 1299721
*/