OHS UM152: Assignment 5 1

OHS M152: Assignment 5

More on modular arithmetic and Euler’s theorem,

(5.1) Order mod 41:

What is the order of 4 mod 41?
Remark: Of course, the numerical answer is not enough, you must also
explain [justify] how you found it.

(5.2) Chinese Remainder Theorem improves Euler’s the-

orem:
If n = pq where p and q are distinct primes, ϕ(n) = (p − 1)(q − 1). Euler’s
theorem states that aϕ(n) ≡ 1 mod n, for all a that are relatively prime to n.
Show that if k = lcm(p − 1, q − 1), ak ≡ 1 mod n.

(5.3) Using primitive roots to solve equations:

Given that 5 is primitive root of 73, find all solutions mod 73 to x3 − 1 ≡
0 mod 73.
Remark: The solutions themselves are only worth half-credit; For full
credit, you must show how to find the solutions using the fact that 5 is a
primitive root.

(5.4) Using primitive roots not to solve equations:

For which primes p will there be a solution to x3 + 1 ≡ 0 mod p other than
x ≡ −1 mod p?
Hint: You may use that there must be primitive roots mod p, and if a
is a primitive root mod p, we know the smallest positive integer k for which
ak ≡ −1 mod p.

(5.5) A Polynomial which Factors, but has no Roots:

Give an example of a polynomial f (x) with integer coefficients which factors
(poly mod n), (i.e. is the product of polynomials of smaller degree poly mod
n) but which has no roots, i.e., for which there are no integers x such that
f (x) ≡ 0 (mod n).

Remark : Your solution should give a specific integer n, and give all of the
coefficients of f (x). It should show that f (x) really does factor, and it should
prove that f (x) has no roots. It might help to first find some polynomials that
have no roots.
OHS UM152: Assignment 5 2

(5.6) Polynomials with Many Roots (mod 9):

Prove: If a is any integer and the polynomial f (x) = x2 + ax + 1 factors
(poly mod 9), then there are THREE distinct non-negative integers y less
than 9 such that f (y) ≡ 0 (mod 9).
Hint: If x2 + ax + 1 ≡ (x + b) · (x + c) (mod 9), what can you deduce about
b and c?
Remark : This problem is very similar to the next problem.

(5.7) Square Polynomials (mod 8):

Prove: If a is any integer and the polynomial f (x) = x2 + ax + 1 factors
(poly mod 8), then f (x) is in fact a square; i.e., f (x) ≡ (x + c)2 (poly mod 8)
for some non-negative integer c less than 8.
What are the possible values of a? That is, for which non-negative a less
than 8 does f (x) factor?
Remark : This problem is very similar to the previous problem.

(5.8) Multiplicative Functions, Euler’s Theorem, RSA

encryption: (this problem is worth 15 points)
Given the prime factorization 9799 = 41 · 239:

(a) Find d(9979).

(b) Find σ(9799).

(c) Find ϕ(9799).

(d) Find 266646 mod 9799

(e) (RSA) If x33 = 2 mod 9799, find x (up to congruence mod 9799).