Added to Favorites

Related Searches

Nearby Words

Different definitions exist depending on the specific field of application. Traditionally, an additive function is a function that preserves the addition operation:
## Completely additive

## Examples

## Multiplicative functions

^{(f(n)-f(1))}.
## References

## See also

- f(x + y) = f(x) + f(y)

In number theory, an additive function is an arithmetic function f(n) of the positive integer n such that whenever a and b are coprime, the function of the product is the sum of the functions:

- f(ab) = f(a) + f(b).

The remainder of this article discusses number theoretic additive functions, using the second definition. For a specific case of the first definition see additive polynomial. Note also that any homomorphism f between Abelian groups is "additive" by the first definition.

An additive function f(n) is said to be completely additive if f(ab) = f(a) + f(b) holds for all positive integers a and b, even when they are not coprime. Totally additive is also used in this sense by analogy with totally multiplicative functions.

Every completely additive function is additive, but not vice versa.

Arithmetic functions which are completely additive are:

- The restriction of the logarithmic function to N
- a
_{0}(n) - the sum of primes dividing n, sometimes called sopfr(n). We have a_{0}(20) = a_{0}(2^{2}· 5) = 2 + 2+ 5 = 9. Some values: (OEIS A001414).

- a
_{0}(4) = 4

- a
_{0}(27) = 9

- a
_{0}(144) = a_{0}(2^{4}· 3^{2}) = a_{0}(2^{4}) + a_{0}(3^{2}) = 8 + 6 = 14

- a
_{0}(2,000) = a_{0}(2^{4}· 5^{3}) = a_{0}(2^{4}) + a_{0}(5^{3}) = 8 + 15 = 23

- a
_{0}(2,003) = 2003

- a
_{0}(54,032,858,972,279) = 1240658

- a
_{0}(54,032,858,972,302) = 1780417

- a
_{0}(20,802,650,704,327,415) = 1240681

- ...

- The function Ω(n), defined as the total number of prime factors of n, counting multiple factors multiple times. It is often called "Big Omega function".This implies Ω(1) = 0 since 1 has no prime factors. Some more values: (OEIS A001222)

- Ω(4) = 2

- Ω(27) = 3

- Ω(144) = Ω(2
^{4}· 3^{2}) = Ω(2^{4}) + Ω(3^{2}) = 4 + 2 = 6

- Ω(2,000) = Ω(2
^{4}· 5^{3}) = Ω(2^{4}) + Ω(5^{3}) = 4 + 3 = 7

- Ω(2,001) = 3

- Ω(2,002) = 4

- Ω(2,003) = 1

- Ω(54,032,858,972,279) = 3

- Ω(54,032,858,972,302) = 6

- Ω(20,802,650,704,327,415) = 7

- ...

- The function a
_{1}(n) - the sum of the distinct primes dividing n, sometimes called sopf(n), is additive but not completely additive. We have a_{1}(1) = 0, a_{1}(20) = 2 + 5 = 7. Some more values: (OEIS A008472)

- a
_{1}(4) = 2

- a
_{1}(27) = 3

- a
_{1}(144) = a_{1}(2^{4}· 3^{2}) = a_{1}(2^{4}) + a_{1}(3^{2}) = 2 + 3 = 5

- a
_{1}(2,000) = a_{1}(2^{4}· 5^{3}) = a_{1}(2^{4}) + a_{1}(5^{3}) = 2 + 5 = 7

- a
_{1}(2,001) = 55

- a
_{1}(2,002) = 33

- a
_{1}(2,003) = 2003

- a
_{1}(54,032,858,972,279) = 1238665

- a
_{1}(54,032,858,972,302) = 1780410

- a
_{1}(20,802,650,704,327,415) = 1238677

- ...

- Another example of an arithmetic function which is additive but not completely additive is ω(n), defined as the total number of different prime factors of n. Some values (compare with Ω(n)) (OEIS A001221)

:

- ω(4) = 1

- ω(27) = 1

- ω(144) = ω(2
^{4}· 3^{2}) = ω(2^{4}) + ω(3^{2}) = 1 + 1 = 2

- ω(2,000) = ω(2
^{4}· 5^{3}) = ω(2^{4}) + ω(5^{3}) = 1 + 1 = 2

- ω(2,001) = 3

- ω(2,002) = 4

- ω(2,003) = 1

- ω(54,032,858,972,279) = 3

- ω(54,032,858,972,302) = 5

- ω(20,802,650,704,327,415) = 5

- ...

From any additive function f(n) it is easy to create a related multiplicative function g(n) i.e. with the property that whenever a and b are coprime we have:

- g(ab) = g(a) × g(b).

- Janko Bračič, Kolobar aritmetičnih funkcij (Ring of arithmetical functions), (Obzornik mat, fiz. 49 (2002) 4, pp 97 - 108) (MSC (2000) 11A25)

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Friday September 12, 2008 at 17:17:29 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Friday September 12, 2008 at 17:17:29 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2015 Dictionary.com, LLC. All rights reserved.