A friend of mine needs to know a formula, given n, that will return an upper bound on the number of prime numbers less than or equal to n. I told him f(n) = n, but he didn’t laugh. I think he wants the lowest upper bound anyone can come up with. Does anyone know a good formula for this?
Your Quadell