Re:2^74207281-1 is Prime
by LeifCarrotson on Tuesday January 19, 2016 @04:41PM
(#10934283)
That's the divisibility check for 3, yes, but I am pretty sure fdej didn't write that number out in decimal. The proof doesn't work with exponents. You'd have to represent the number in base 10 for digit summing to work.
To check, 2^6-1=63 is divisible by three (it might work), but 2^9-1 has a sum of 12 and a value of 511, which is not divisible by three (it's 170 * 3 = 510 + 1).
I'll get back to you once I find a piece a paper large enough to write down the 10 sextillion decimal digits.
The proof is left as an exercise for the student.