Math 406, Introduction to Number Theory 10/16/14

MIDTERM EXAM

1) a) Apply the Euclidean algorithm to compute gcd(361, 209).

b) Find three pairs of integers (x, y) such that 361x + 209y = gcd(361, 209).

2) Determine how many different integers n 1 are such that the congruence
1234 5678 mod n
holds. Justify your answer.

3) Solve the linear congruence 35x 40 mod 65.

4) Suppose that a, b, c are positive integers such that c is odd, c divides a + b, and
c divides a b.
a) Prove that c divides a.
b) Prove that c divides gcd(a, b).

5) Let p and q be two prime numbers with p < q, and suppose that pq + 1 is equal
to the square of a natural number. Prove that q = p + 2.

6) a) State Fermats Theorem.

b) Prove that 11 divides 333888 + 888333 .

**********************************
Extra Credit Problem:

EC) Compute the remainder when 25! is divided by 29.

Problems 1-6 and EC are worth 20/15/15/15/15/20/15 points, respectively.

GOOD LUCK!