Talk:De Polignac numbers: Difference between revisions
m
→Efficient algorithm: reword, correct order of operations
Thundergnat (talk | contribs) (commentary) |
Thundergnat (talk | contribs) m (→Efficient algorithm: reword, correct order of operations) |
||
Line 4:
It is not necessary to test add every power of 2 less than N with every prime less than N and check if the sum is N.
Simply find the powers of 2 less than N, subtract
| |||