2 ms·
My favorite proof is Fuerstenberg's proof of the infinitude of primes, seen here: http://primes.utm.edu/notes/proofs/infinite/topproof.html http://primes.utm.ed
by pmiller2 17y ago
My favorite proof is Fuerstenberg's proof of the infinitude of primes, seen here: http://primes.utm.edu/notes/proofs/infinite/topproof.html http://primes.utm.edu/notes/proofs/infinite/topproof.html
- RiderOfGiraffes 17y agoThat's brilliant! I up-voted you - no idea why it didn't stick.
- pmiller2 17y agoThe real reason it works is actually deep magic. Dirichlet's theorem states: given any two positive coprime integers $a$ and $d$, there are infinitely many primes of the form $a + nd$ where $n$ is a positive integer. This result is one of the deeper facts of analytic number theory. I have no clue in hell how to prove it other than "look it up in Hardy and Littlewood."
- dissonant 17y agoHaha. Actually, Hardy and Littlewood in 'An Introduction...' don't prove this result, stating that it is too difficult! They do prove some subcases, though!