4 ms·
This number (removed, as it seemed to cause problem in some browsers, sorry) fails the Fermat test for base 2 (i.e. 2^(p-1) is not 1 mod p). I can't believe it
by ninguem2 11y ago
This number (removed, as it seemed to cause problem in some browsers, sorry) fails the Fermat test for base 2 (i.e. 2^(p-1) is not 1 mod p). I can't believe it will pass Miller-Rabin. Edit: fails all bases up to 1000.
- nathancahill 11y agoCongrats, you broke HN.
- ninguem2 11y agoWhat, how?
- nathancahill 11y agoStick the number in a code block (4 spaces at the beginning of the line). The CSS here doesn't handle long strings well.
- deleted 11y ago[deleted]