fn is_prime(num: u64) -> bool {
if num < 2 {
return false;
}
let sqrt = (num as f64).sqrt() as u64;
for i in 2..=sqrt {
if num % i == 0 {
return false;
}
}
true
}
fn main() {
let mut count = 0;
let mut number = 1;
let target = 100_001;
while count < target {
number += 1;
if is_prime(number) {
count += 1;
}
}
println!("The {}st prime number is: {}", target, number);
}
/*
run:
The 100001st prime number is: 1299721
*/