Fermat's last theorem implies Euclid's infinitude of primes
From MaRDI portal
(Redirected from Publication:4964194)
Abstract: We show that Fermat's last theorem and a combinatorial theorem of Schur on monochromatic solutions of implies that there exist infinitely many primes. In particular, for small exponents such as or this gives a new proof of Euclid's theorem, as in this case Fermat's last theorem has a proof that does not use the infinitude of primes. Similarly, we discuss implications of Roth's theorem on arithmetic progressions, Hindman's theorem, and infinite Ramsey theory towards Euclid's theorem. As a consequence we see that Euclid's Theorem is a necessary condition for many interesting (seemingly unrelated) results in mathematics.
Recommendations
Cites work
- A New Proof of Euclid's Theorem
- A new proof of Szemerédi's theorem
- A short proof of Hindman's theorem
- A Superpowered Euclidean Prime Generator
- Fermat’s Last Theorem for Amateurs
- Finite sums from sequences within cells of a partition of N
- Finiteness theorems for abelian varieties over number fields.
- Graph theory
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 192839 (Why is no real title available?)
- scientific article; zbMATH DE number 1194925 (Why is no real title available?)
- scientific article; zbMATH DE number 1090401 (Why is no real title available?)
- Meta math! The quest for omega
- Modular elliptic curves and Fermat's Last Theorem
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- On Certain Sets of Integers
- On Certain Sets of Positive Density
- On sets of integers containing k elements in arithmetic progression
- On the Infinitude of Primes
- Prime divisors of thin sequences
- Quantitative theorems for regular systems of equations
- Roth's theorem on progressions revisited
- Squares in Arithmetic Progressions and Infinitely Many Primes
- The Little Book of Bigger Primes
- van der Waerden and the Primes
Cited in
(6)- A Connection between Furstenberg’s and Euclid’s Proofs of the Infinitude of Primes
- The Green-Tao Theorem and the Infinitude of Primes in Domains
- Fermat's last theorem, Schur's theorem (in Ramsey theory), and the infinitude of the primes
- A discrete approach to the asymptotic enumeration of sets of primes and MacMahon's partition statistics
- The Infinitude of the Primes and Some Coloring Theorems
- Folkman's theorem and the primes
This page was built for publication: Fermat's last theorem implies Euclid's infinitude of primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964194)