Check that that you have all three pages. You may assume multiplicativity where appropriate.
τ (n) = the number of positive divisors of n, σ(n) = the sum of the positive divisors of n,
φ(n) = the Euler phi-function, µ(n) = the Möbius function, ω(n) = number of distinct primes dividing n.
2. (12 points) Use the Chinese Remainder Theorem to solve the system of simultaneous congruences:
x ≡ 2 (mod 5)
x ≡ 4 (mod 7)
x ≡ 1 (mod 8)
3. (12 points) (a) Find (381, 408) and write this g.c.d. as a linear combination of the two numbers.
pg score/30
1
X
4. (14 points) (a) Show that if f (n) and g(n) are multiplicative then so is F (n) = f (d)g(d).
d|n
X
(b) Define G(n) to be the multiplicative function G(n) = µ(d)σ(d).
d|n
X
(a) From the Möbius Inversion Formula f (n) = .
d|n
2
6. (18 points) Circle True (T) or False (F).
T F (a) The equation 15x ≡ 21 (mod 35) has 5 solutions mod 35.
T F (c) n = 44 is abundant.
T F (e) If {x1 , ..., xk } is a reduced residue system mod m then so is {−x1 , ..., −xk }.
T F (g) Euler’s Theorem says that aφ(n) ≡ 1 (mod n) for all positive integers a.
7. (12 points) (a) Suppose that gcd(a, m) = 1. Define ordm a, the order of a mod m.
(c) Suppose that gcd(a, 17) = 1. What does Fermat’s Little Theorem tell you about ord17 a?
8. (5 points) Show that there are infinitely many n with µ(n) = µ(n + 2) = 0.
9. (9 points) Find three positive integers n with φ(n) = 16. Bonus point for each additional value.
pg score/44