A combinatorial theorem of Schur implies infinitude of primes
Labib Haddad
TL;DR
The paper explores how a combinatorial theorem related to Schur's work can be used to demonstrate the infinite nature of prime numbers, connecting combinatorics with number theory.
Contribution
It introduces a new combinatorial approach inspired by Schur's theorem to provide an alternative proof of the infinitude of primes.
Findings
Establishes a link between Schur's combinatorial theorem and prime infinitude
Simplifies previous proofs of Euclid's theorem using combinatorics
Comments on recent related work by Elsholz
Abstract
Comments about the paper by Elsholz, Fermat's last theorem implies Euclid's infinitude of primes, (2021), and simplification.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Algebraic Geometry and Number Theory