Infinitude of Primes - An Impossible Injection

This is a recent proof by Dustin J. Mixon. (I am grateful to Claus Ivo Doering for bringing it to my attention.)

Proof

Suppose there are a total of \(N\;\) primes, \(2=p_{1}\lt p_{2}\lt\ldots\lt p_{N}\), and pick \(K\;\) such that \(2^{K}\gt (K+1)^N\).

Consider the mapping \(f: \{1,\ldots,2^{K}\}\rightarrow\{0,\ldots,K\}^N\;\) defined by \(f(x):=(k_{1},\ldots,k_{N})\), where \(x=p_{1}^{k_1}\cdot\ldots\cdot p_{N}^{k_N}\;\) is the prime factorization of \(x\).