A Successive Approximation Algorithm for Computing the Divisor Summatory Function

2012/06/15 by Sladkey, Richard
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1206.3369

Abstract

An algorithm is presented to compute isolated values of the divisor summatory function in O(n^(1/3)) time and O (log n) space. The algorithm is elementary and uses a geometric approach of successive approximation combined with coordinate transformation.

Related

• Computation of the Totient Summatory Function
• Divisor Problem and an Analogue of Euler's Summation Formula
• An Explicit Formula For The Divisor Function
• Rapidly Convergent Series of the Divisors Functions
• Summing μ(n): a faster elementary algorithm