# Keeping Hardy spinning in his grave

If there are infinitely many Mersenne primes, more efficient error-correcting codes exist for problems in which only a few bits of a message need to be recovered, given a high transmission error rate. Even finitely many additional such primes would improve the length of these codes; this kind of coding has applications in both cryptography and the theory of approximation algorithms. And you probably thought (as did I) that all the computational effort devoted to the search for Mersenne primes was purely an exercise in recreational math...

Via Scott "Shtetl-Optimized" Aaronson.

That's quite amazing. The guy was in the cubicle next to mine this summer. There's some people who you interact with and you know right away that they're so insanely smart they're in a whole different league; you can never hope to be like them, but you can only watch in awe and cheer them on.

Nice site... Well done good luck

Via Scott "Shtetl-Optimized" Aaronson.

### Comments:

**arvindn**:

**2006-10-10T02:42:03Z**

That's quite amazing. The guy was in the cubicle next to mine this summer. There's some people who you interact with and you know right away that they're so insanely smart they're in a whole different league; you can never hope to be like them, but you can only watch in awe and cheer them on.

**None**: re: nice

**2006-12-06T14:32:39Z**

Nice site... Well done good luck