function isPrime(num) {
if (num < 2) return false;
for (let i = 2; i <= Math.sqrt(num); i++) {
if (num % i === 0) return false;
}
return true;
}
function findNthPrime(target) {
let count = 0;
let number = 1;
while (count < target) {
number++;
if (isPrime(number)) {
count++;
}
}
return number;
}
// Benchmark execution time
console.time('Execution Time');
const target = 100001;
const result = findNthPrime(target);
console.log(`The ${target}st prime number is: ${result}`);
console.timeEnd('Execution Time');
/*
run:
The 100001st prime number is: 1299721
Execution Time: 228.27ms
*/