Yes, I think my statement needs to be amended to say: Edit: Actually I wasn't sure there exists even a single algorithm capable of producing only prime numbers as n -> infinity, even if the results for n below a "really large" were a subset of all primes. But Rowland (from wasoxygen's wiki article above) apparently managed to do exactly that. Can you imagine being a reviewer for this article? It would be incredibly punishing to go through every problem and substitute increasing n until you saw whether or not it continued to meet the criteria after leaving the "small n" domain. In fact, a reviewer wouldn't do that, they'd write code to do it for them, even in 1988....no known set of functions, mappings, transformations etc. that generates ALL prime numbers.