Mersenne Prime Exponents by JOrE20 (proper computation)

n=1
while n<90:n+=1;pow(3,2**n-1,2**n-1)<4==print(n)

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

To protect the system from spam, please input your favorite sport (hint: I believe its name must start with 'g', case insensitive)

download

return to the top page