Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-14T09:08:59.944Z Has data issue: false hasContentIssue false

The Divisibility of Divisor Functions

Published online by Cambridge University Press:  18 May 2009

R. A. Rankin
Affiliation:
The University Glasgow
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For any positive integers n and v let

where d runs through all the positive divisors of n. For each positive integer k and real x > 1, denote by N(v, k; x) the number of positive integers n ≦ x for which σv(n) is not divisible by k. Then Watson [6] has shown that, when v is odd,

as x → ∞; it is assumed here and throughout that v and k are fixed and independent of x. It follows, in particular, that σ (n) is almost always divisible by k. A brief account of the ideas used by Watson will be found in § 10.6 of Hardy's book on Ramanujan [2].

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1961