Talk:Primes whose sum of digits is 25: Difference between revisions
Talk:Primes whose sum of digits is 25 (view source)
Revision as of 12:41, 21 March 2021
, 3 years agono edit summary
mNo edit summary |
mNo edit summary |
||
Line 3:
: I think it is possible to put an upper limit on primes whose digits sum to 25 and have no zeroes in them. The largest number with no internal zeros and a digit sum of 25 would be 1111111111111111111111111 (25 digits). --[[User:Tigerofdarkness|Tigerofdarkness]] ([[User talk:Tigerofdarkness|talk]]) 10:54, 21 March 2021 (UTC)
: Correct, stretch goal updated. If zeroes were allowed there would be an infinite number of them. It will need reasonably decent bignum handling and a fast prime number checker. I expect this is not really do-able in asm, C, etc. I would put a reasonable (soft) upper limit of say 30 mins runtime on this and not be too critical of anything around that. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 12:34, 21 March 2021 (UTC)
|