Lecture 5 Flashcards

1
Q

Multiplicative functions

A

An arithemetical function f is called multiplicative if f ≠ 0 and if
* f(mn) = f(m)f(n),

whenever gcd(m, n) = 1.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Completely Multiplicative functions

A

A multiplicative function f is called completely multiplicative if we also have
* f(mn) = f(m)f(n)

for all m, n.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

If f is multiplicative, what is f(1)

A

f(1) = 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

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

A

If and only if f is multiplicative

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

When does f(p^a) = f(p)^a, for all primes p and all integers a ≥ 1

A

If and only if f is completely multiplicative

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

When is the Dirichlet product f*g multiplicative

A

When f and g are multiplicative

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Is the Dirichlet convolution of two completely multiplicative functions always completely multiplicative

A

Not always

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Is the Dirichlet inverse of a multiplicative function multiplicative

A

Yes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How can we define complete multiplicativity through the D inverse and mobius functiopn

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is Liouville’s function

A

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}
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Is Liouville’s function multiplicative

A

It is completely multiplicative

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How can we use Liouville’s function to find square numbers

A

For every n ≥ 1, we have

  • ∑_(d∣n) λ(d) =
    • 1 if n is a square,
    • 0 otherwise.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the divisor function (The sum of the α-th powers of the divisors of n)

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Are the divisor functions completely multiplicative

A

No, in general only multiplicativw

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Inverse of divisor function

A

σ^(−1)α (n) = ∑(d∣n) d^α µ(d)µ(n/d)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly