A Successive Approximation Algorithm for Computing the Divisor Summatory Function

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.

21 pages, 8 figures

Cited by in corpus (1)

• The Abundancy Index and Feebly Amicable Numbers