Hostname: page-component-8448b6f56d-sxzjt Total loading time: 0 Render date: 2024-04-24T13:03:55.963Z Has data issue: false hasContentIssue false
  • English
  • Français

The Average Number of Divisors in an Arithmetic Progression

Published online by Cambridge University Press:  20 November 2018

R. A. Smith  and
M. V. Subbarao
R. A. Smith
Affiliation:
Department of Mathematics, University of Toronto, Toronto M5S 1A1, Canada
M. V. Subbarao
Affiliation:
Department of Mathematics, University of Alberta, Edmonton T6G 2G1, Canada
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.

Let l and k be positive integers. Then for each integer n ≥ 1, define d(n; l, k) to be the number of (positive) divisors of n which lie in the arithmetic progression I mod k. Note that d(n;1,1) = d(n), the ordinary divisor function.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 24 , Issue 1 , 01 March 1981 , pp. 37 - 41
Copyright
Copyright © Canadian Mathematical Society 1981

References

1. Berndt, B., On the average order of ideal functions and other arithmetic functions, Bull. Amer. Math. Soc. 76 (1962), 1270-1274.Google Scholar
2. Chandrasekharan, K. and Narasimhan, R., Functional equations with multiple gamma factors and the average order of arithmetic functions, Annals of Math. (2) 76 (1962), 93-136.Google Scholar
3. Lehmer, D. H., Euler's constant for arithmetic progressions, Acta Arith. 27 (1962), 125-142.Google Scholar
4. Prachar, K., Primzahlverteilung, Springer-Verlag, Berlin (1962).Google Scholar
5. Zogin, I. I., Certain asymptotic equations connected with the problem of Dirichlet on divisors. A generalization of the Dirichlet Theorem. Sverdlovsk. Gos. Ped. Inst. Ucen. Zap. 31 (1962), 87-96.Google Scholar