Math 371 HW, 9/6

Spencer Taylor
September 6, 2019

1.1: 7. By the division algorithm, we know that a ∈ Z will be equal to

3k, 3k + 1, or 3k + 2, for an integer q. Then we have three cases: a2 = 9q 2 ,
9q 2 + 6q + 1, or q 2 + 12q + 4.

In the first case, set k = 3q 2 . Then a2 = 3k.

In the second case, set k = 3q 2 + 2q. Then a2 = 3k + 1.

In the third case, set k = 3q 2 + 4q + 1. Then a2 = 3k + 1.

Hence in all cases, we have that a2 = 3k or 3k + 1.

9. The division algorithm again gives us the fact that a ∈ Z = 3k, 3k + 1, or

3k + 2. Hence we again have three cases: a3 = 27q 3 , a3 = 27q 3 + 27q 2 + 9q + 1,
or a3 = 27q 3 + 54q 2 + 36q + 8.

In the first case. set k = 3q. Then a3 = 9k.

In the second case, set k = 3q 3 + 3q 2 + q. Then a3 = 9k + 1.

In the third case, set k = 3q 3 + 6q 2 + 12q. Then a3 = 9k + 8.

Hence in all cases, we have that a3 = 3k, 3k + 1, or 3k + 9.

10. Assume that a and c leave the same remainder when divided by n.
Then a = qn + r and c = pn + r, for some q, p ∈ Z and with n > r ≥ 0. Then
a − c = n(q − p). Set q − p = k ∈ Z. Hence a − c = nk, for some integer k.

Conversely, assume that a − c = nk, for some k ∈ Z. Hence n|(a − c, so

using the division algorithm on (a − c) and n gives no remainder. Hence a
divided by n with the division algorithm and c divided by n with the division
algorithm yields no remainder, hence a and c have the same remainder.

1.2: 12. (a) False. clearly a|a, ab, so (a, b) 6= 1.

1
 (b) False. If (b, c) 6= 1, then (a, c) 6= 1.
(c) False. If b|c, then (a, c) 6= 1.

14. This is simply the GCD of the two integers, so we have

(a) 3
(b) 1.