T2. 7. Arithmetic Functions Flashcards
Define arithmetic functions
A function from the natural numbers to complex
Define the Dirichlet convolution of arithmetic functions
f*g(n) = SUM _d|n g(n/d)
State the outcome:
11
1μ
What implication?
= 1
= 0
μ is the inverse of 1 under Dirichlet convolution
State the mobius inversion formula
Define g(n) = SUM_d|n f(d)
f(n) = SUM_d|n g(d)μ(n/d)
Give the SUM_1,∞ f*g/n^s
= SUM_1,∞ f(n)/n^s SUM_1,∞ g(n)/n^s
What is the condition for an poly arithmetic function to be multiplicative
If f(mn) = f(m)f(n) whenever (m,n) = 1
What is the condition for an poly arithmetic function to be completely multiplicative
If f(mn) = f(m)f(n) for all m,n
How do multiplicative and completely multiplicative functions generalise the RZ formula?
SUM_n,∞ f(n)/n^s =
- Check notes :)
- PROD_p 1/1-f(p)p^-s
How does μ generalise the RZ formula? Why?
It is completely multiplicative
SUM_n,∞ μ(n)/n^s = 1/ζ
What remark can we make for f multiplicative and not the zero function?
f(1) = 1
Give the literal and convolution definition of the Euler totient function
φ(n) = #{a ∈ N : a ≤ n and (a, n) = 1}
φ(n) = μ*N
How does φ generalise the RZ formula? Why?
SUM_n,∞ μ(n)/n^s = 1/ζ