On the sum of k(n) in the Piltz divisor problem for k=3 and k=4

Abstract

Let k(x) be the error term in the classical asymptotic formula for the sum Σn≤ xdk(n), where dk(n) is the number of ways n can be written as a product of k factors. We study the analytic properties of the Dirichlet series Σn=1∞k(n)n-s and use Perron's formula to estimate the sums Σn≤ x3(n) and Σn≤ x4(n) for large x>0.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…