Furstenberg's proof of the infinitude of primes

In mathematics, particularly in number theory, Hillel Furstenberg's proof of the infinitude of primes is a topological proof that the integers contain infinitely many prime numbers. When examined closely, the proof is less a statement about topology than a statement about certain properties of arithmetic sequences.[1][2] Unlike Euclid's classical proof, Furstenberg's proof is a proof by contradiction. The proof was published in 1955 in the American Mathematical Monthly while Furstenberg was still an undergraduate student at Yeshiva University.

  1. ^ Cite error: The named reference mercer was invoked but never defined (see the help page).
  2. ^ Clark, Pete L. (2017). "The Euclidean Criterion for Irreducibles". The American Mathematical Monthly. 124 (3): 198–216. doi:10.4169/amer.math.monthly.124.3.198. ISSN 0002-9890. JSTOR 10.4169/amer.math.monthly.124.3.198. S2CID 92986609. See discussion immediately prior to Lemma 3.2 or see Section 3.5.