Partitioning the natural numbers to prove the infinitude of primes

DOI10.4169/COLLEGE.MATH.J.48.3.217zbMATH Open1443.97016OpenAlexW2614553819MaRDI QIDQ4581672FDOQ4581672

Authors: Arpan Sadhukhan 

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.217

Recommendations

• New Proofs of Euclid's and Euler's Theorems
• Two short proofs of the infinitude of primes
• A note on Euclid's theorem concerning the infinitude of the primes
• Sieving for the primes to prove their infinitude
• Several arithmetic proofs on the infinitude of prime numbers

Mathematics Subject Classification ID

Primes (11A41) Number theory (educational aspects) (97F60)

Cited In (3)

• Infinitely many composite NSW numbers: an inductive proof
• Partitions in the prime number maze
• Title not available (Why is that?)

This page was built for publication: Partitioning the natural numbers to prove the infinitude of primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581672)