The guy's no newb, one of his previous papers massively impressed its reviewers too. As someone with an interest in mathematics, this announcement excites me greatly. He's taken the infinite step, all anyone else will be able to do will be finite improvements.
Proofs with really big numbers intrigue me but are kind of disconcerting. It "feels" like you should be able to prove anything with just a handfull of numbers: 0, 1, 2, pi, e, maybe some square roots. Anything between say pi and infinity just seems so arbitrary.
The basic idea with the sieving process here is to take a big tupple of numbers p+ki, and show that it must contain a second prime. The length of the tupple taken is 3500000.
If you want to see where the 70000000 comes from try in wolfram alpha:
PrimePi(n)-PrimePi(3500000)=3500000 where PrimePi is the prime counting function returning the number of primes less than a number. And you get a better value of n = 63374611.
About the hole-through-the-ball problem:
I heard about it (well, roughly the same
thing, called the 'napkin ring problem') a few
months ago, and I wanted to try calculating
the volume without doing the subtraction
(sphere-cylinder-caps). I wrote up how
to get the volume directly by integration: http://minortriad.com/napkinring.pdf