Lecture 5 Flashcards
Multiplicative functions
An arithemetical function f is called multiplicative if f ≠ 0 and if
* f(mn) = f(m)f(n),
whenever gcd(m, n) = 1.
Completely Multiplicative functions
A multiplicative function f is called completely multiplicative if we also have
* f(mn) = f(m)f(n)
for all m, n.
If f is multiplicative, what is f(1)
f(1) = 1
When does f(p^a1_11. . . p^ak_k) = f(p^a1_1) . . . f(p^ak_k), for all primes pi and all integers ai ≥ 1
If and only if f is multiplicative
When does f(p^a) = f(p)^a, for all primes p and all integers a ≥ 1
If and only if f is completely multiplicative
When is the Dirichlet product f*g multiplicative
When f and g are multiplicative
Is the Dirichlet convolution of two completely multiplicative functions always completely multiplicative
Not always
Is the Dirichlet inverse of a multiplicative function multiplicative
Yes
How can we define complete multiplicativity through the D inverse and mobius functiopn
Let f be a multiplicative function. Then f is a completely multiplicative function if and only if
- f^(−1)(n) = µ(n)f(n)
for all n ≥ 1.
What is Liouville’s function
For n > 1, write n = p^a1_1. . . p^ak_k. Then Liouville’s function is defined as follows:
- λ(n) ∶=
*1 if n = 1- (−1)^(a1+…+ak) if n > 1}
Is Liouville’s function multiplicative
It is completely multiplicative
How can we use Liouville’s function to find square numbers
For every n ≥ 1, we have
- ∑_(d∣n) λ(d) =
- 1 if n is a square,
- 0 otherwise.
What is the divisor function (The sum of the α-th powers of the divisors of n)
For α ∈ R or α ∈ C and for any integer n ≥ 1, we define
- σα(n) = ∑_(d∣n) d^α
to be the sum of the α-th powers of the divisors of n
Are the divisor functions completely multiplicative
No, in general only multiplicativw
Inverse of divisor function
σ^(−1)α (n) = ∑(d∣n) d^α µ(d)µ(n/d)