Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Furstenberg's Proof of the Infinitude of Primes

Number Theory

Hillel Furstenberg's proof of the infinitude of primes is a topological argument, published in 1955 in the American Mathematical Monthly, showing that there are infinitely many prime numbers. Furstenberg wrote the proof as an undergraduate at Yeshiva University. Unlike Euclid's classical argument, Furstenberg's proof proceeds by contradiction, and although it is framed in terms of a topology on the integers, its real content concerns properties of arithmetic sequences.

Facts
Statement
Define a topology on the integers Z by declaring a subset U ⊆ Z to be an open set if and only if it is a union of arithmetic sequences S(a, b) for a ≠ 0, or is empty 1
Proof Year
1955 1
Classification
Statement Form
Characterization Theorem 1
Connections

Has Statement Form

Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.

In Branch

Source Furstenberg's proof of the infinitude of primes - Wikipedia
Sources
1. Furstenberg's proof of the infinitude of primes - Wikipedia
  • Furstenberg's proof section
    Define a topology on the integers Z by declaring a subset U ⊆ Z to be an open set if and only if it is a union of arithmetic sequences S(a, b) for a ≠ 0, or is empty
  • Lead section
    The proof was published in 1955 in the American Mathematical Monthly while he was still an undergraduate student at Yeshiva University.
  • In Branch: Number Theory, Lead sentence
    In mathematics, particularly in number theory, Hillel Furstenberg's proof of the infinitude of primes is a topological proof that
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.