Counting functions for sums of rational powers of integers

Abstract

Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by u1j/k + u2j/k + ... + ulj/k, ui ∈ Z+, the number of values less than or equal to a given w>0 is determined. The counting functions developed are framed in terms of convolution exponentials, and are closely related to the Riemann zeta function. At the conclusion, several estimates are derived, with special emphasis on the case of sums of square roots, i.e. j=1, k=2.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…