Completely Multiplicative Function

A completely multiplicative function (or totally multiplicative function) is an arithmetic function (that is, a function whose domain is the natural numbers), such that f(1) = 1 and f(ab) = f(a) f(b) holds for all positive integers a and b.

Without the requirement that f(1) = 1, one could still have f(1) = 0, but then f(a) = 0 for all positive integers a, so this is not a very strong restriction.

Read more about Completely Multiplicative Function:  Examples, Properties

Famous quotes containing the words completely and/or function:

    A quality is something capable of being completely embodied. A law never can be embodied in its character as a law except by determining a habit. A quality is how something may or might have been. A law is how an endless future must continue to be.
    Charles Sanders Peirce (1839–1914)

    Uses are always much broader than functions, and usually far less contentious. The word function carries overtones of purpose and propriety, of concern with why something was developed rather than with how it has actually been found useful. The function of automobiles is to transport people and objects, but they are used for a variety of other purposes—as homes, offices, bedrooms, henhouses, jetties, breakwaters, even offensive weapons.
    Frank Smith (b. 1928)