function isPrime(num: number): boolean {
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: number): number {
let count: number = 0;
let num: number = 1;
while (count < target) {
num++;
if (isPrime(num)) {
count++;
}
}
return num;
}
const target = 100001;
const result = findNthPrime(target);
console.log(`The ${target}st prime number is: ${result}`);
/*
run:
"The 100001st prime number is: 1299721"
*/