Math 2.0

statement theorem

Multiplicativity of the divisor function

Statement

Let kk be a natural number. The divisor function σk\sigma_k is a multiplicative function. That is, σk(mn)=σk(m)σk(n)\sigma_k(mn) = \sigma_k(m) \sigma_k(n) for all coprime positive integers mm and nn.

Remarks

The proof: for coprime mm and nn, each divisor of mnmn is a unique product ded e with d∣md \mid m and e∣ne \mid n. The function σk\sigma_k is not completely multiplicative: σ0(4)=3\sigma_0(4) = 3, but σ0(2)2=4\sigma_0(2)^2 = 4. At a prime power, σk(pe)=1+pk+p2k+⋯+pek\sigma_k(p^e) = 1 + p^k + p^{2k} + \dots + p^{ek}. Multiplicativity then gives σk(n)\sigma_k(n) for all nn.

Explanations

L1 human

For example, σ(4)=7\sigma(4) = 7 and σ(3)=4\sigma(3) = 4, so σ(12)=28\sigma(12) = 28. This works because 44 and 33 share no prime factor. Each divisor of 1212 is a divisor of 44 times a divisor of 33.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (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 8 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. Divisors of a natural number definition
  4. Greatest common divisor definition
  5. Divisor function definition
  6. Coprime integers definition
  7. Multiplicative function definition
  8. Multiplicativity of the divisor function statement

Sources

  1. Web https://en.wikipedia.org/wiki/Divisor_function, Properties