In this paper we bring to light an upper bound for the prime counting
function π(x) using elementary methods, that holds not only for large
positive real numbers but for all positive reals. It puts a threshold on the
number of primes p≤x for any given x