A recursion for divisor function over divisors belonging to a prescribed finite sequence of positive integers and a solution of the Lahiri problem for divisor function σx(n)

Abstract

For a finite sequence of positive integers A=\aj\j=1k, we prove a recursion for divisor function σx(A)(n)=Σd|n, d∈ Adx. As a corollary, we give an affirmative solution of the problem posed in 1969 by D. B. Lahiri [3]: to find an identity for divisor function σx(n) similar to the classic pentagonal recursion in case of x=1.

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…