Math 2.0

Number theory Definition

Multiplicative function

Builds on Arithmetic functionCoprime integers

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.

Reading path

To understand this page from the ground up, read these 5 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

Where this leads

5 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Multiplicative_function, lead section
About this page
Tag0AP80TT660
URIm2://0AP80TT660
Kinddefinition
WritingW1 stated
MSC11A25
DefinesMultiplicative function
UsesArithmetic function, Coprime integers

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

Used by