Partitioning the natural numbers to prove the infinitude of primes

Article Type

Research Article

Publication Title

College Mathematics Journal

Abstract

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.

First Page

217

Last Page

218

DOI

10.4169/college.math.j.48.3.217

Publication Date

5-1-2017

This document is currently not available here.

Share

COinS