Talk:Primes whose sum of digits is 25: Difference between revisions
Talk:Primes whose sum of digits is 25 (view source)
Revision as of 17:58, 29 March 2021
, 3 years ago→The limit of primes that do not contain zeroes
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)
: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)
== Perhaps the syntax of the task title could be normalized ? ==
| |||