# Arithmetical Functions

• Emil Grosswald
Part of the Modern Birkhäuser Classics book series (MBC)

## Abstract

Let us denote by Z + the set of natural integers; clearly Z +Z. Functions whose domain is Z or Z + are usually called arithmetical functions (sometimes also number-theoretic functions), regardless of their range. It is, of course, easy to fabricate such functions out of any functions defined over Q, R, or C, simply by considering their restrictions to Z or Z +. But this rarely leads to interesting results. So for instance if we restrict the function y = x 2 to xZ, we simply obtain the sequence of squares; if we restrict y = sin πx to xZ, we obtain y = 0 for all xZ, and so on. It is much more interesting to consider functions that have Z or Z + as their natural domain, which means that we cannot give them a simple, sensible interpretation unless the independent variable is an integer. So for instance it makes sense to speak about the number of divisors of an integer π, but no simple meaning can be attached to the number of divisors of π, or of e, or of i. We already met with some arithmetical functions. One of them, the Legendre-Jacobi-Kronecker symbol, has been discussed in Chapter 5; another is the number of divisors of an integer; still another one is Euler’s Φ-function. In the present chapter we shall study these and also a few other arithmetical functions. In addition, we shall discuss two functions that are not, properly speaking, arithmetic functions, being defined over the reals; their connection with arithmetical functions is so close, though, that this seems the logical place to study them.

## Keywords

Dirichlet Series Arithmetical Function Euler Function Natural Integer Perfect Number
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Bibliography

1. 1.
M. Buxton and S. R. Elmore, Abstract 731–10–40 Notices AMS, 23 (1976) A-55.Google Scholar
2. 2.
J. Condict, Unpublished senior thesis, Middlebury College, Middlebury, Vermont, June 1979.Google Scholar
3. 3.
L. E. Dickson, History of the Theory of Numbers, Vol. 1. Washington, D.C.: Carnegie Inst, of Washington, 1919–1923.Google Scholar
4. 4.
L. Euler, Comm. Acad. Petrop. 6 (1732–3) 103–107; Opera Omnia (1) 2,1–5.Google Scholar
5. 5.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 3rd ed. Oxford: The Clarendon Press, 1954.
6. 6.
P. Hagis and W. L. McDaniel, Mathem. of Computation 29 (1975) 922–924.
7. 7.
P. Hagis, Mathematics of Computation, 35 (1980) pp. 1027–1032.
8. 8.
H. J. Kanold, Journal für die reine und angewandte Mathem. 186 (1944) 25–29; 197 (1957) 82–96.
9. 9.
U. Kühnel, Mathem. Zeitschrift, 52 (1949) 202–211.
10. 10.
E. Landau, Handbuch der Lehre von der Verteilung der Primzahlen, 2nd ed. New York: Chelsea Publishing Co., 1953.
11. 11.
E. A. Lucas, Amer. Journal of Mathem. 1 (1878) 185–240, 289–321.Google Scholar
12. 12.
S. Ramanujan, Collected Papers, edited by G. H. Hardy, P. V. Sashu Aiyar, and B. M. Wilson. Cambridge: Cambridge University Press, 1927.Google Scholar
13. 13.
B. Riemann and R. Dedekind, Erläuterung zu den Fragmenten XXVIII, Collected Works of B. Riemann, edited by H. Weber, 2nd ed. (1892–1902). New York: Dover Publications, 1953.Google Scholar
14. 14.
P. Tchebycheff, Several memoirs, see in partic. Journal des Math, pures et appliquées (1) 17 (1852) 366–390.Google Scholar
15. 15.
C. van den Eynden, Amer. Math. Monthly 79 (1972), 625.
16. 16.
I. M. Vinogradov, Elements of Number Theory. New York: Dover Publications, 1954.