Arithmetic function: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (→Examples: added Möbius function) |
imported>Richard Pinch m (sp, link) |
||
Line 1: | Line 1: | ||
{{subpages}} | {{subpages}} | ||
In [[number theory]], an '''arithmetic function''' is a function defined on the set of [[ | In [[number theory]], an '''arithmetic function''' is a function defined on the set of [[positive integer]]s, usually with [[integer]], [[real number|real]] or [[complex number|complex]] values. | ||
Revision as of 13:24, 1 December 2008
In number theory, an arithmetic function is a function defined on the set of positive integers, usually with integer, real or complex values.
Classes of arithmetic function
Arithmetic functions which have some connexion with the additive or multiplicative structure of the integers are of particular interest in number theory. We define a function a(n) on positive integers to be
- Totally multiplicative if for all m and n.
- Multiplicative if whenever m and n are coprime.
Examples
- Carmichael's lambda function
- Euler's totient function
- Jordan's totient function
- Möbius function