Title: Revisiting Euclid's Proof of the Infinitude of Primes
Speaker: Edinah Gnang, Rutgers University
Date: Wednesday, October 17, 2012 12:10pm
Location: Graduate Student Lounge, 7th Floor, Hill Center, Rutgers University, Busch Campus, Piscataway, NJ
We discuss a variation of Euclid's Proof so as to turns the proof into a combinatorial algorithm for sifting primes. We further modify our construction to sieve out totally odd numbers and describe our ongoing efforts to estimates their density among the integers. This is joint work with Patrick Devlin.
Graduate Student Combinatorics Seminars