Given a number n, determine what the nth prime is.
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
If your language provides methods in the standard library to deal with prime numbers, pretend they don't exist and implement them yourself.
The test runner has access to two cores as of 2025-07-28. An exhaustive approach may not benefit from raku's hyper or race. You can check with:
note Kernel.cpu-cores
# 2
Sign up to Exercism to learn and master Raku with 94 exercises, and real human mentoring, all for free.