Two short proofs of the infinitude of primes
From MaRDI portal
Publication:4581671
DOI10.4169/COLLEGE.MATH.J.48.3.214zbMATH Open1443.97011OpenAlexW2615385559WikidataQ113692030 ScholiaQ113692030MaRDI QIDQ4581671FDOQ4581671
Authors: Sam Northshield
Publication date: 20 August 2018
Published in: The College Mathematics Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4169/college.math.j.48.3.214
Recommendations
Cites Work
Cited In (15)
- Proving Infinitude of Prime Numbers Using Binomial Coefficients
- A simple proof of the infinitude of primes
- On bounded arithmetic augmented by the ability to count certain sets of primes
- Dirichletino
- On Furstenberg's proof of the infinitude of primes
- A short generalized proof of infinitude of primes
- Sieving for the primes to prove their infinitude
- A note on Euclid's theorem concerning the infinitude of the primes
- New Proofs of Euclid's and Euler's Theorems
- Title not available (Why is that?)
- Euclidean proofs for function fields
- A Linked Pair of Sequences Implies the Primes Are Infinite
- Rings with few units and the infinitude of primes
- Partitioning the natural numbers to prove the infinitude of primes
- A Formula and a Proof of the Infinitude of the Primes
This page was built for publication: Two short proofs of the infinitude of primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581671)