We know that by Dirichlet's formula for the Divisor function $ \displaystyle \sum\limits\_{n \leq x} d(n) = x \log{x} + (2C-1)x + \mathcal{O}(\sqrt{x})$.


What is the best approximation available till date for the given formula. I know that finding the infimum of the $\mathcal{O}'s$ is an unsolved problem, but would like to see the closest approximation.



Dirichlet's Divisor Function
Use Wikipedia: <http://en.wikipedia.org/wiki/Dirichlet_divisor_problem> .


