PyPE solution to PE problem 7
Registered by
Scott Armitage
PyPE solution to PE problem 7
Blueprint information
- Status:
- Complete
- Approver:
- None
- Priority:
- Undefined
- Drafter:
- None
- Direction:
- Needs approval
- Assignee:
- None
- Definition:
- Approved
- Series goal:
- None
- Implementation:
-
Implemented
- Milestone target:
- None
- Started by
- Scott Armitage
- Completed by
- Scott Armitage
Whiteboard
ProjectEule
===
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see
that the 6^(th) prime is 13.
What is the 10001^(st) prime number?
Solution
--------
A decent prime number generator can be found in PyPE.pemath. Since we don't
know what /value/ the 10001st prime number will have, we take a stab at it;
if the list that we generate does not have sufficient elements, we raise
this limit and try again. This is somewhat of a brute-force approach that
works sufficiently well for the problem at hand, but likely has poor scaling
capabilities.
Answer
------
104743
(?)
