Talk:Primes whose sum of digits is 25: Difference between revisions
Content added Content deleted
(→The limit of primes that do not contain zeroes: Added a comment about C++ authorship.) |
|||
| Line 9: | Line 9: | ||
:::I am indeed proper impressed and I take my hat off to you, good sir. I've also spotted the Pascal entry does it in 6s! --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 17:35, 29 March 2021 (UTC) |
:::I am indeed proper impressed and I take my hat off to you, good sir. I've also spotted the Pascal entry does it in 6s! --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 17:35, 29 March 2021 (UTC) |
||
::::Incidentally, the C++ version was written by Simonjsaunders using a similar approach to Phix and Go. No surprise that it's a lot faster than Go which is handicapped by the overhead of Cgo when using the GMP wrapper but is still significantly faster than Go's native big.Int. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 18:31, 29 March 2021 (UTC) |
|||
:Have just played with the Pascal entry on tio, and found the answer to ''I don't know why there is one more probably prime'': 1 and 2 fail but mpz_probab_prime_p(z,3) gets the right answer. C++ might benefit from 25->3 too. Left it to you lot to update your own entries & times. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 17:58, 29 March 2021 (UTC) |
:Have just played with the Pascal entry on tio, and found the answer to ''I don't know why there is one more probably prime'': 1 and 2 fail but mpz_probab_prime_p(z,3) gets the right answer. C++ might benefit from 25->3 too. Left it to you lot to update your own entries & times. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 17:58, 29 March 2021 (UTC) |
||