A note on two Erdősʼs proofs of the infinitude of primes

P. Erdős found numerous theorems, problems, results and conjectures in elementary number theory. Some of them are two Erdősʼs proofs of of the famous Euclidʼs theorem on the infinitude of primes. As noticed below, one of these proofs immediately implies the fact that the number of primes smaller than x is .