Content deleted Content added
m made "fundamental theorem of arithmetic" a link |
m Link directly to square-free integer, instead of square-free disambig page |
||
Line 11:
Examples of multiplicative functions include many functions of importance in number theory, such as:
* <math>\phi</math>(''n''): [[Euler's totient function]] <math>\phi</math>, counting the positive integers [[coprime]] to (but not bigger than) ''n''
* <math>\mu</math>(''n''): the [[Möbius function]], related to the number of prime factors of [[square-free integer|square-free]] numbers
* gcd(''n'',''k''): the [[greatest common divisor]] of ''n'' and ''k'', where ''k'' is a fixed integer.
* ''d''(''n''): the number of positive [[divisor]]s of ''n'',
| |||