Anonymous user
Talk:Pernicious numbers: Difference between revisions
→C solution too cryptic?: yes it is
(→C solution too cryptic?: yes it is) |
|||
Line 4:
:Edit, hum after some analysis it appears that 2693408940 encodes the prime numbers in its binary form: 10100000100010100010100010101100. From right to left, starting from 0, the one marks the primes. Sill this could use some explanations.--[[User:Grondilu|Grondilu]] ([[User talk:Grondilu|talk]]) 14:51, 12 March 2014 (UTC)
:OK, I understand now. I added some comments in the code. Hope it's ok.--[[User:Grondilu|Grondilu]] ([[User talk:Grondilu|talk]]) 15:02, 12 March 2014 (UTC)
:: Er yeah, it was pretty cryptic, and your analysis is absolutely correct. But I changed the routine again for something faster, though I did put in some comments this time. I didn't retain the "0b010011..." literal format since it's a GCC exteinsion, but if you want it back in I'm not really troubled by it. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 19:40, 12 March 2014 (UTC)
| |||