Squares in Arithmetic Progressions and Infinitely Many Primes
From MaRDI portal
Publication:4575441
Abstract: We give a new proof that there are infinitely many primes, relying on van der Waerden's theorem for coloring the integers, and Fermat's theorem that there cannot be four squares in an arithmetic progression. We go on to discuss where else these ideas have come together in the past.
Recommendations
- Squares in arithmetic progression over number fields
- Squares in arithmetic progressions
- scientific article; zbMATH DE number 4041997
- On sums of squares of primes
- Sums of almost equal squares of primes
- Squarefull numbers in arithmetic progressions
- Squarefree numbers in arithmetic progressions
- Squarefree Numbers in Arithmetic Progressions
- Squares of primes and powers of 2
- scientific article; zbMATH DE number 2016575
Cites work
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 3497986 (Why is no real title available?)
- scientific article; zbMATH DE number 2247920 (Why is no real title available?)
- A new proof of Szemerédi's theorem
- A note on squares in arithmetic progressions. II
- Additive combinatorics
- On sets of integers containing k elements in arithmetic progression
- Squares in arithmetic progressions
- van der Waerden and the Primes
Cited in
(6)- Fermat's last theorem, Schur's theorem (in Ramsey theory), and the infinitude of the primes
- Fermat's last theorem implies Euclid's infinitude of primes
- Fermat's two-squares theorem -- a study for heuristics of proving
- The Green-Tao Theorem and the Infinitude of Primes in Domains
- Uniform bounds for the number of powers in arithmetic progressions
- Powers in arithmetic progressions
This page was built for publication: Squares in Arithmetic Progressions and Infinitely Many Primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575441)
