Content deleted Content added
No edit summary |
+prime counting function pi(n)+ME |
||
Line 6:
The articles on additive and multiplicative functions contain several important examples.
Examples of a non-multiplicative functions are:
An example of a non-multiplicative function is ''c''<sub>''4''</sub>(''n'') - the number of ways that ''n'' can be expressed as the sum of four squares of nonnegative integers, where we distinguish between different orders of the summands. For example:▼
▲
:1 = 1<sup>2</sup>+0<sup>2</sup>+0<sup>2</sup>+0<sup>2</sup> = 0<sup>2</sup>+1<sup>2</sup>+0<sup>2</sup>+0<sup>2</sup> = 0<sup>2</sup>+0<sup>2</sup>+1<sup>2</sup>+0<sup>2</sup> = 0<sup>2</sup>+0<sup>2</sup>+0<sup>2</sup>+1<sup>2</sup>,▼
▲::1 = 1<sup>2</sup>+0<sup>2</sup>+0<sup>2</sup>+0<sup>2</sup> = 0<sup>2</sup>+1<sup>2</sup>+0<sup>2</sup>+0<sup>2</sup> = 0<sup>2</sup>+0<sup>2</sup>+1<sup>2</sup>+0<sup>2</sup> = 0<sup>2</sup>+0<sup>2</sup>+0<sup>2</sup>+1<sup>2</sup>,
hence ''c''<sub>4</sub>(1)=4 ≠ 1.▼
▲:hence ''c''<sub>4</sub>(1)=4 ≠ 1.
Another example of a non-multiplicative function is the [[partition function]] ''P''(''n''), the number of representations of ''n'' as a sum of positive integers, where we don't distinguish between different orders of the summands. For instance: ''P''(2 · 5) = ''P''(10) = 42 and ''P''(2)''P''(5) = 2 · 7 = 14 ≠ 42. ▼
▲
* the [[Prime number theorem|Prime counting function]] π (''n'') - the number of primes less than or equal to a given number ''n''. We have π(1) = 0 ≠ 1, π (2 · 5) = π(10) = 4 and π(2) π(5) = 1 · 3 = 3 ≠ 4.
|