KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
This is not a homework, I am just curious. INFINITE is the key word here. I wish to use it as for p in primes() . I believe that this is a built-in function in Haskell. So, the answer cannot be as naive as "Just do a Sieve". First of all, you do not know how many consecutive primes will be consumed. Well, suppose you could concoct 100 of them at a time. Would you use the same Sieve approach as well as the frequency of prime numbers formula? I prefer non-concurrent approach. Thank you for reading (and writing ;) )!
Tags (comma-separated)
Save Edits
Cancel