Section 1.

5. By the Division Algorithm, a = 3q + r, 0 r < 3. Thus r = 0, 1, 2.

Then a2 = (3q + r)2 = 9q 2 + 6qr + r 2 . If r = 0 then a2 = 3(3q 2 ); if r = 1, then
a2 = 3(3q 2 + 2q) + 1; and if r = 2, then a2 = 3(3q 2 + 2q + 1) + 1. In every case
therefore, a2 is of form 3k or 3k + 1.

6. Let m be an odd integer. By the Division Algorithm, m = 4q + r, 0 r < 4,

so that r = 0, 1, 2, 3. If r = 0, 2 then m is divisible by 2, a contradiction. Thus
r = 1, 3.

8. (a) Remainder is always 1.

(b) Conjecture: the square of an odd integer always leaves remainder 1 when
divided by 8.
(c) Let m be an odd integer. Them m = 2k + 1, for an integer k, and m2 1 =
(4k 2 + 4k + 1) 1 = 4 k(k + 1). Now either k or k + 1 is even, and hence k(k + 1)
is even, so that 4k(k + 1) is a multiple of 8, and we are done.