Sisyphus sequence: Difference between revisions
Relaxed the task requirements to help RPL and other onboard calculator languages.
(add RPL) |
(Relaxed the task requirements to help RPL and other onboard calculator languages.) |
||
Line 19:
What are the '''1,000'''th, '''10,000'''th, '''100,000'''th and '''1,000,000'''th terms of the sequence and, in each case, what is the highest prime needed to reach them?
If it is difficult or impossible for your language or output device to meet all of these requirements, then just do what you reasonably can.
;Stretch
| |||