This is the whole point, the function should not produle all 1_000_000 numbers every time it's called. It should create only as many primes as it is asked for. If the function asks you only for numbers smaller than 10_000, and you still calculate prime numbers above 10_000, then it's an error in the solution.
The tests test for laziness.
As explained above, to test for laziness
This is the whole point, the function should not produle all 1_000_000 numbers every time it's called. It should create only as many primes as it is asked for. If the function asks you only for numbers smaller than 10_000, and you still calculate prime numbers above 10_000, then it's an error in the solution.
The tests test for laziness.