I have this code :

```
fn find_next_prime(start: u32) -> u32 {
let mut nbr = start;
let mut prime;
loop {
prime = true;
for i in 2..(nbr / 2 + 1) {
if nbr % i == 0 {
prime = false;
break;
}
}
if prime {
break;
}
nbr += 1;
}
nbr
}
pub fn nth(n: u32) -> u32 {
let mut found_prime = 0;
let mut count_found_primes = 0;
loop {
if count_found_primes == n {
return found_prime;
}
found_prime = find_next_prime(found_prime);
count_found_primes += 1;
}
}
```

but for every n the answer is now 2.

any hints how to make this work ?