From binomial coefficients to primes – Chebyshev revisited

Using only simple combinatorial arguments and binomial coefficients, this paper proves upper and lower bounds for the number of primes up to $x$.

Add new comment