Math 2.0

Number theory Definition

Completely multiplicative function

Builds on Arithmetic functionMultiplicative function

Definition

An arithmetic function ff is completely multiplicative if f(1)=1f(1) = 1 and f(mn)=f(m)f(n)f(mn) = f(m) f(n) for all positive integers mm and nn.

Remarks

Each completely multiplicative function is multiplicative. The converse fails: Euler's totient function has φ(4)=2\varphi(4) = 2 but φ(2)2=1\varphi(2)^2 = 1. A completely multiplicative function is determined by its values at the primes. Examples are n↦nkn \mapsto n^k, the Liouville function and, for a fixed odd prime pp, the Legendre symbol n↦(np)n \mapsto \left(\frac{n}{p}\right).

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Arithmetic function definition
  2. Divisibility definition
  3. Greatest common divisor definition
  4. Coprime integers definition
  5. Multiplicative function definition
  6. Completely multiplicative function definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Completely_multiplicative_function, Definition
About this page
Tag0GS27TKF1V
URIm2://0GS27TKF1V
Aliasestotally-multiplicative-function
Kinddefinition
WritingW1 stated
MSC11A25
DefinesCompletely multiplicative function
UsesArithmetic function, Multiplicative function

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.