Arithmetic function: Difference between revisions

Revision as of 18:33, 10 January 2024

Revision as of 21:37, 21 January 2024

Line 1:

{{list|date=July 2020}}

{{short description|Function whose ___domain is the positive integers}}

In [[number theory]], an '''arithmetic''', '''arithmetical''', or '''number-theoretic function'''<ref>{{harvtxt|Long|1972|p=151}}</ref><ref>{{harvtxt|Pettofrezzo|Byrkit|1970|p=58}}</ref> is for most authors<ref>Niven & Zuckerman, 4.2.</ref><ref>Nagell, I.9.</ref><ref>Bateman & Diamond, 2.1.</ref>generally any [[Function (mathematics)|function]] ''f''(''n'') whose ___domain is the [[natural number|positive integers]] and whose range is a [[subset]] of the [[complex number]]s.<ref>Niven & Zuckerman, 4.2.</ref><ref>Nagell, I.9.</ref><ref>Bateman & Diamond, 2.1.</ref> Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of ''n''".<ref>Hardy & Wright, intro. to Ch. XVI</ref> There is a larger class of number-theoretic functions that do not fit this definition, for example, the [[prime-counting function]]s. This article provides links to functions of both classes.

An example of an arithmetic function is the [[divisor function]] whose value at a positive integer ''n'' is equal to the number of divisors of ''n''.

There is a larger class of number-theoretic functions that do not fit the above definition, for example, the [[prime-counting function]]s. This article provides links to functions of both classes.

Arithmetic functions are often extremely irregular (see [[#First 100 values of some arithmetic functions|table]]), but some of them have series expansions in terms of [[Ramanujan's sum]].