There Are Many Primes

Gödel's Lost Letter and P=NP

HillelFurstenberg

Hillel Furstenberg is entering his 50th years as a professor of mathematics at Hebrew University in Jerusalem. He shared the 2006-07 Wolf Prize with Stephen Smale. He has shown many connections between analysis and combinatorics. One was showing how ergodic theory can prove Endre Szemerdi’s theorem that every positive-density subset of the integers includes arbitrarily-long arithmetic progressions $latex {[a + bn]}&fg=000000$. This led to a new multidimensional formulation with Yitzhak Katznelson, and the two later proved positive-density versions of the Hales-Jewett theorem.

Today Ken and I wish to discuss proofs of the infinitude of primes, and what they begin to say about analysis and combinatorics.

View original post 1,615 more words

Advertisements

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s