Right? That's why I said i thought it was blocked by this kata without that rule being specified in the instructions.

SciPY is on the list of available libraries in the above link, but I cannot access it for the purposes of this kata.

The kata doesn't even specify which libraries are blocked. All the formula-based ones I can find require scipy which appears to be blocked. Am I to understand that the only way to solve this is to construct the prime counting theorem from scratch? That's not really a coding exercise to to speak.

Tried several ways to do this but keep timing out at the higher levels. Anyone who completed willing to give a hint?

Is the correct solution to use a sieve to generate the primes or to use a formula to determine the number? When I try the former it keeps timing out, when I try the latter none of the libraries that have the needed functionality seem to be available.

Thanks, I figured this out.

I attempted to complete this in R. I believe one of the test cases is incorrect:

For (163,1,50) in which there is only a single location, a route that should choose 1 location with a max distance of 163, the result should be 50 - the single available point which is < 163. However, the test case for this entry says the result should be NULL. I believe this is incorrect.

Is this kata doable in R? It seems impossible to return an array as described in the tests because R arrays cannot mix types. I have completed this but since numeric values are coerced to strings it keeps failing the tests.

Working on this one and have the solution correct - except the growth percent doesn't calculate on the second row, shows up as ##.#%. All other rows are accurate. Any ideas of where to look?