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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.