Prime number generator(s)
Registered by
Scott Armitage
Prime numbers are a common occurrence in Project Euler problems, and as such we require a fast, efficient method for generating a list of prime numbers. One popular algorithm for this is the Sieve of Eratosthenes (http://
The prime number generator is called `primes` and can be found in the module `pype.pemath`.
Blueprint information
- Status:
- Complete
- Approver:
- Scott Armitage
- Priority:
- Low
- Drafter:
- Scott Armitage
- Direction:
- Approved
- Assignee:
- Scott Armitage
- Definition:
- Approved
- Series goal:
- Accepted for trunk
- Implementation:
-
Implemented
- Milestone target:
- None
- Started by
- Scott Armitage
- Completed by
- Scott Armitage
Whiteboard
The `primes` function has been moved to `PyPE.pemath` in bzr init.
(?)
