Re: easily computable?
- --- In firstname.lastname@example.org,
Chris Caldwell <caldwell@...> wrote:
> There is a fine old article you should read by Herbert WilfMoreover, Herb's article was productive:
> which is "What is an answer?" American Mathematical Monthly,
> 89 (1982), 289-292).
> Added in proof: After reading a preprint of this article,[Here, pi(x) means the number of primes not exceeding x.]
> Jeffrey Lagarias and Andrew Odlyzko of Bell Laboratories
> found an algorithm that computes pi(x) in time
> O(x^(3/5+eps)): a true "formula" for pi(x).
gives an idea of his influence.