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.