Talk:Strange unique prime triplets: Difference between revisions
→added a stretch goal: Further comment.
(→added a stretch goal: Added a comment.) |
(→added a stretch goal: Further comment.) |
||
Line 33:
:Although I don't intend to post it on the main page as it's not part of the task, I coded a second Go version which uses a sieve rather than individual prime calculations and found that there were 74,588,542 unique prime triples under '''10,000''' which sum to a prime. This runs in about 4.3 seconds on my machine (core i7). --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 15:21, 10 March 2021 (UTC)
::Just tried the same thing with Wren and the timing there was a much more sedate 213 seconds. So a higher stretch goal is feasible for the interpreted languages but probably best left where it is :) --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 15:36, 10 March 2021 (UTC)
|