MATH215Spring 2011

Homework Set 1 Solutions

Exercises 4-9 pp. 53-54:
4. Prove the following statements concerning positive integers a, b and c.
(i) (a divides b) and (a divides c) a divides (b + c).
(ii) (a divides b) or (a divides c) a divides bc.
Proof
(i) Since a divides b, there exists an integer j such that aj = b. Since a divides c, there exists an
integer k such that ak = c. Therefore, b + c = aj + ak = a(j + k). Since j and k are integers,
j + k is an integer, say j + k = `. So, b + c = a`, and a divides b + c, as desired.
(ii) Suppose that a divides b. Then there exists an integer j such that aj = b. So bc = ajb. Since j
and b are integers, their product is an integer, say jb = m. Then bc = am, and so a divides bc,
as desired. Suppose instead that a divides c. Then there exists an integer k such that ak = c. So
bc = abk. Since b and k are integers, their product is an integer, say bk = n. Then bc = an, and
a divides bc, as desired. The two results together allow us to conclude the desired statement.
5. This problem doesnt require proofs. Ill just give the answers here without explanation. You should
think of proofs/counterexamples for yourself.
(i) Necessary not sufficient.
(ii) Neither necessary nor sufficient.
(iii) Sufficient not necessary.
(iv) Sufficient not necessary.
(v) Necessary and sufficient.
(vi) Necessary and sufficient.
(vii) Necessary not sufficient.
6. Use the properties of addition and multiplication of real numbers given in properties 2.3.1 to deduce
that, for all real numbers a and b,
(i) a 0 = 0 = 0 a,
(ii) (a)b = ab = a(b),
(iii) (a)(b) = ab.
Proof
0 = 0+0
Zero property.
a 0 = a (0 + 0)
Multiply both sides by a.
(i)
a 0 = a 0 + a 0 Distributivity.
0 = a0
Subtract a 0 from both sides.
Since a 0 = 0 a by commutativity, we conclude that a 0 = 0 = 0 a.

(ii)

ab + (a)b = (a + (a))b Distributivity.

= 0b
Subtraction.
= 0
From (i), above.
But the equation ab + x = 0 has unique solution x = ab, so (a)b = ab. Similarly,
ab + a(b) = a(b + (b)) Distributivity.
= a0
Subtraction.
= 0
From (i), above.
And so by the same reasoning as above, a(b) = ab. Therefore, (a)b = ab = a(b).
ab + (a)(b)

= (a)b + (a)(b) From (ii), above.

= (a)(b + (b))
Distributivity.
(iii)
= a 0
Subtraction.
= 0
From (i), above.
But the equation ab + x = 0 has unique solution x = ab. Therefore, (a)(b) = ab.
7. Prove by contradiction the following statement concerning an integer n.
n2 is even n is even.
[You may suppose that an integer n is odd if and only if n = 2q + 1 for some integer q.]
Proof
Let n be an integer such that n2 is even. Assume for contradiction that n is odd. Then n = 2q + 1 for
some integer q. Therefore,
n2 = (2q + 1)2 = 4q 2 + 4q + 1 = 2(2q 2 + 2q) + 1
and so n2 is odd, since 2q 2 + 2q is an integer. But this contradicts our assumption that n2 is even.
Therefore, n is even.
8. Prove the following statements concerning a real number x.
(i) x2 x 2 = 0 x = 1 or x = 2.
(ii) x2 x 2 > 0 x < 1 or x > 2.
Proof
x2 x 2 = 0 (x + 1)(x 2) = 0
x + 1 = 0 or x 2 = 0
(i)
x = 1 or x = 2
x2 x 2 > 0
(ii)

(x + 1)(x 2) > 0
[(x + 1) > 0 and (x 2) > 0] or [(x + 1) < 0 and (x 2) < 0]
[x > 1 and x > 2] or [x < 1 and x < 2]
x > 2 or x < 1

9. Prove by contradiction that there does not exist a largest integer.

Proof
Suppose for contradiction that there is a largest integer. Let this integer be n. Since n and 1 are
integers, their sum n + 1 is an integer. Since 0 < 1, it follows by the Addition Law (Axiom 3.1.2(ii))
that n < n + 1, contradicting our assumption that n is the largest integer. We conclude that there
does not exist a largest integer.