180
Views
0
CrossRef citations to date
0
Altmetric
CLASSROOM CAPSULES

Partitioning the Natural Numbers to Prove the Infinitude of Primes

 

Summary

In this note we will introduce a partition of the natural numbers and use it to give two proofs of the infinitude of primes. The first proof is a slight variant of the various known combinatorial proofs. The second is similar to Euler's proof but it makes no use of Euler's product formula.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.