Elementary Growth Estimates for the Prime Counting Function

We consider the prime counting function which counts the number of primes less than a certain number. As we know from Euclid's Theorem, this function will tend to infinity. Euclid's proof provides a relatively straight forward, but elementary, bound on the rate of growth of the prime counting function which we prove and improve upon in further videos.

#mikethemathematician, #mikedabkowski, #profdabkowski, #numbertheory

Видео Elementary Growth Estimates for the Prime Counting Function канала Mike, the Mathematician