Skip to content

Instantly share code, notes, and snippets.

@Hermann-SW
Created December 23, 2024 14:24
Show Gist options
  • Save Hermann-SW/03db00ca6cb23c9b7c1fb3e6530494b6 to your computer and use it in GitHub Desktop.
Save Hermann-SW/03db00ca6cb23c9b7c1fb3e6530494b6 to your computer and use it in GitHub Desktop.
PARI/GP proof that Mersenne exponent 500000500001 does not give Mersenne prime (291.0g resident memory needed)
m=2^500000500001-1;
##
d=2 * 1663403835355 * 500000500001 + 1;
##
m%d
##
#binary(d)
##
@Hermann-SW
Copy link
Author

Script above is useless, can be computed in 3ms on slow Raspberry computer with not much RAM:

pi@raspberrypi5:~ $ gp -q
?
? d=2 * 1663403835355 * 500000500001 + 1;
? Mod(2,d)^500000500001 - 1
Mod(0, 1663405498762162162670711)
? ##
  ***   last result: cpu time 0 ms, real time 3 ms.
?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment