Wanted: An Easy Proof of a Weak Theorem in NT so that I can get another VDW--> Primes infinite proof to be really easy.
Posted 4 days ago (via blog.computationalcomplexity.org)
(All math in this article is here) A while back I posted about a proof that Van Der Waerden's theorem implies the number of primes is infinite (see the post here). That post brought up some logical issues. More recently there is another proof that the primes are infinite that raises (for me at least) some number theory results and proofs. The proof uses the following theorem:There are no