News for hackers. Stuff that matters.
Re:2^74207281-1 is Prime by dsr_ on Tuesday January 19, 2016 @03:56PM (#10933950)
Write out the number in decimal, add the digits together: if the result is larger than a single digit, repeat. When you have a single digit, if it is 3, 6 or 9, the number is divisible by 3.

The proof is left as an exercise for the student.

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).

Re:2^74207281-1 is Prime by morsch on Tuesday January 19, 2016 @04:35PM (#10934236)
I'll get back to you once I find a piece a paper large enough to write down the 10 sextillion decimal digits.
Re:2^74207281-1 is Prime by nickodell on Tuesday January 19, 2016 @04:32PM (#10934220)
How did you write out the number? It's 10307545155701210591839 digits long.