Math 2.0

definition

Multiplicative function

Definition

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

Remarks

A multiplicative function is determined by its values at prime powers: if n=p1e1⋯pkekn = p_1^{e_1} \cdots p_k^{e_k}, then f(n)=f(p1e1)⋯f(pkek)f(n) = f(p_1^{e_1}) \cdots f(p_k^{e_k}). Examples are Euler's totient function, the divisor function and the Möbius function. A function with f(mn)=f(m)f(n)f(mn) = f(m) f(n) for all mm and nn is completely multiplicative.

Explanations

L1 human

For a multiplicative function, you can compute f(n)f(n) from the prime factorization of nn. For example, φ(12)=φ(4)φ(3)=2⋅2=4\varphi(12) = \varphi(4) \varphi(3) = 2 \cdot 2 = 4, because 44 and 33 are coprime.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 5 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Arithmetic function definition
  2. Divisibility definition
  3. Greatest common divisor definition
  4. Coprime integers definition
  5. Multiplicative function definition

What depends on this

4 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Multiplicative_function, lead section