Scribd
Upload
37 views2 pages

Math4024 TUT2022 05

This document contains tutorial questions for the MATH4024: Number Theory course at the University of the Witwatersrand, focusing on arithmetic functions. It includes definitions, properties, and proofs related to multiplicative functions, the Euler phi function, and Dirichlet convolution. The tutorial aims to deepen understanding of key concepts in number theory through problem-solving.

Uploaded by

James Mlotshwa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views2 pages

Math4024 TUT2022 05

This document contains tutorial questions for the MATH4024: Number Theory course at the University of the Witwatersrand, focusing on arithmetic functions. It includes definitions, properties, and proofs related to multiplicative functions, the Euler phi function, and Dirichlet convolution. The tutorial aims to deepen understanding of key concepts in number theory through problem-solving.

Uploaded by

James Mlotshwa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIVERSITY OF THE WITWATERSRAND

SCHOOL OF MATHEMATICS
MATH4024: NUMBER THEORY, Lecturer Prof. A. Munagi

Tutorial Questions part 5


Arithmetic Functions I
1. Let f be an arithmetic function with f (1) = 1.
(a) (i) When is f said to be multiplicative? When is f said to be completely multiplicative?
(ii) Give two examples of arithmetic functions which are not multiplicative.
Name one multiplicative arithmetic function which is not completely multiplicative.
(b) Prove:
(i) f is multiplicative if and only if f (pa1 1 · · · pakk ) = f (pa1 1 ) · · · f (pakk ) for all distinct primes
pi and integers ai ≥ 1.
(ii) If f is multiplicative, then f is completely multiplicative if and only if f (pa ) = f (p)a
for all primes p and integers a ≥ 1.
2. (a) For which positive integers n does ϕ(3n) = 3ϕ(n)?
(b) Prove: ϕ(2n) = 2ϕ(n) if n is even, and ϕ(2n) = ϕ(n) if n is odd.
3. Show that if m and n are positive integers with m|n, then ϕ(n)|ϕ(n).
4. Compute the Number and Sum of the positive integer divisors of each of the integers: (a)
1000 (b) 2.3.5.7.11.

5. Prove that τ (n) is odd if and only if n is a square.


6. (a) Prove: if k is a nonnegative integer, then f (n) = nk is completely multiplicative.
P k
(b) Use part (a) to prove that σk is multiplicative, where σk (n) = d .
d|n

(Recall that σ0 = τ and σ1 = σ).


7. (a) Prove that the sum of divisors function σ and the number of divisors function τ are
multiplicative functions.
X X
(b) Derive the identities (a) n = µ(n/d)σ(d) (b) 1 = µ(n/d)τ (d).
d|n d|n

Arithmetic Functions II
1. (a) State the Mobius inversion formula.
(b) Prove:
P an arithmetic function f is multiplicative if and only if the summatory function,
F (n) = d|n f (d), is multiplicative.
(c) Use parts (a) and (b), or otherwise, to show that the Euler phi function ϕ is multiplicative.
P
2. Let f (n) be an arithmetic function, and define g(n) = f (d). Use Mobius inversion to
d|n
write f (30) as a sum and difference of values of the arithmetic function g.

1
Prof A. Munagi Tutorial Questions part 5 MATH4024-Number Theory

3. The Dirichlet convolution ∗ of two arithmetic functions f and g is defined by


X
f ∗g = f (d)g(n/d).
d|n

(c) Prove: if f and g are multiplicative, then f ∗ g is a multiplicative arithmetic function.


 
1
(a) Define the function I by I(n) = . Prove that
n
(i) I is completely multiplicative;
(ii) f ∗ I = I ∗ f = f .
(b) Define the function u by u(n) = 1 for all n ∈ Z+ . Prove that
(i) µ ∗ u = I;
(ii) If g = f ∗ u, then f = g ∗ µ;
(iii) If f = g ∗ µ, then g = f ∗ u.

4. Let f, g, h be multiplicative arithmetic functions. Prove that


(i) f ∗ g = g ∗ f ;
(ii) f ∗ (g ∗ h) = (f ∗ g) ∗ h.
5. Prove: if f is multiplicative, then f (1) = 1.

6. Let A be the set of all arithmetic functions f such that f (1) = 1. Prove that (A, ∗) is an
abelian group.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy