arXiv Analytics

Sign in

arXiv:0903.1743 [math.NT]AbstractReferencesReviewsResources

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)$

Vladimir Shevelev

Published 2009-03-10, updated 2009-03-23Version 4

For a finite sequence of positive integers $A=\{a_j\}_{j=1}^{k},$ we prove a recursion for divisor function $\sigma_{x}^{(A)}(n)=\sum_{d|n,\enskip d\in A}d^x.$ 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 $\sigma_x(n)$ similar to the classic pentagonal recursion in case of $x=1.$

Comments: 11 pages, improvement of the text of Introduction; addition of Section 5
Categories: math.NT
Subjects: 11B37
Related articles: Most relevant | Search more
arXiv:1808.07550 [math.NT] (Published 2018-08-22)
On Gaps in the Closures of Images of Divisor Functions
arXiv:1206.2148 [math.NT] (Published 2012-06-11, updated 2012-07-28)
Sumsets in primes containing almost all even positive integers
arXiv:1311.4041 [math.NT] (Published 2013-11-16, updated 2014-03-23)
The Mean Square of Divisor Function