Computing the Summation of the Möbius Function

We describe an elementary method for computing isolated values of M(x) = Σ n≤x μ(n), where μ is the Mobius function. The complexity of the algorithm is O(x 2/3 (log log x)1/3) time and O(x 1/3(log log x)2/3) space. Certain values of M(x) for x up to 1016 are listed: for instance, M(1016) = −3195437.