Assignment 2 – MA 341

Due at the beginning of class: Wednesday, Feb. 2, 2011

Numbered exercises are taken from the textbook (Elementary number theory, Jones &
Jones).

To be handed in
(1) Show that if n is a square, then the remainder of n divided by 3 is either 0 or 1.

(2) What are the possible remainders when a cube is divided by 3? Prove your assertion.

(3) Let a, b ∈ Z and suppose a|b and b|a. What can you say about a and b? Prove your
assertion.

(4) Suppose that a2 + b2 = c2 with a, b, c ∈ Z. Show that a and b can’t both be odd.

(5) Find all pairs (a, b) of positive integers such that ab = 72 and gcd(a, b) = 3.

(6) Use the Euclidean algorithm to find gcd(770, 882).

(7) Suppose d ∈ N is a common divisor of a and b (a and b not both zero). Show that
 
a b gcd(a, b)
gcd , = .
d d d

(8) Suppose a and b are not both zero. Show that, for all k ∈ Z,

gcd(a, b) = gcd(a, b + ka).

Extra credit
(X1) Let g, s ∈ Z. Show that there exist x, y ∈ Z such that x + y = s and gcd(x, y) = g
if, and only if, g|s.

(X2) Suppose a and b are relatively prime. Show that gcd(a + b, a − b) = 1 or 2.

(X3) Suppose a and b are relatively prime. Show that gcd(a + b, a2 − ab + b2 ) = 1 or 3.

Practice problems (not to be handed in)

Chapter 1: 1.3(c), 1.6, 1.8, 1.11, 1.12