Scribd
Upload
16 views2 pages

Assignment 9 SOLUTIONS

This document contains solutions to mathematical thinking assignments. It addresses relationships between divisibility concepts like b|a and a/b, and proves various properties of divisibility including: if a|b and b|c then a|c; if a|b and c|d then ac|bd; and that if p is prime then the square root of p is irrational. The solutions are detailed, addressing each part of the assignments thoroughly through formal proofs and justification.

Uploaded by

oli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views2 pages

Assignment 9 SOLUTIONS

This document contains solutions to mathematical thinking assignments. It addresses relationships between divisibility concepts like b|a and a/b, and proves various properties of divisibility including: if a|b and b|c then a|c; if a|b and c|d then ac|bd; and that if p is prime then the square root of p is irrational. The solutions are detailed, addressing each part of the assignments thoroughly through formal proofs and justification.

Uploaded by

oli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

KEITH DEVLIN: Introduction to Mathematical Thinking (Fall 2012) ASSIGNMENT 9 – SOLUTIONS

PLEASE NOTE: THESE ARE SIMPLY MY SOLUTIONS. YOURS MAY LOOK QUITE
DIFFERENT, BUT STILL COULD BE CORRECT.

1. Express as concisely and accurately as you can the relationship between b|a and a/b.

SOLUTION
a/b is a notation that denotes the rational number a divided by b. b|a denotes the relation that b
divides a, i.e., there is an integer q such that a = qb. In the case where b|a, then q = a/b.
Thus, b|a iff a/b is an integer.

2. Determine whether each of the following is true or false and prove your answer. (You saw these
questions in the in-lecture quiz, so the first part is a repeat, except that now you should know the right
answers.) The focus of this assignment is to prove each of your answers.
(a) 0|7 (b) 9|0 (c) 0|0 (d) 1|1

(e) 7|44 (f) 7|(−42) (g) (−7)|49 (h) (−7)|(−56)

(i) (∀n ∈ Z)[1|n] (j) (∀n ∈ N )[n|0] (k) (∀n ∈ Z)[n|0]

SOLUTION
(a) False. a|b includes the requirement a 6= 0.
(b) True. 0 = 0 × 9, so (∃q)(0 = q.9).
(c) False. a|b includes the requirement a 6= 0.
(d) True. 1 = 1 × 1, so (∃q)(1 = q.1).
(e) False. ¬(∃q)(44 = q.7).
(f) True. −42 = (−6) × 7.
(g) True. 49 = (−7) × (−7).
(h) True. −56 = 8 × (−7).
(i) True. For any n ∈ Z, n = n.1.
(j) True. For any n ∈ Z, 0 = 0.n.
(k) False. n|0 includes the requirement n 6= 0.
3. Prove all the parts of the theorem in the lecture, giving the basic properties of divisibility. Namely,
show that for any integers a, b, c, d, with a 6= 0:
(a) a|0, a|a ;
(b) a|1 if and only if a = ±1 ;
(c) if a|b and c|d, then ac|bd (for c 6= 0) ;
(d) if a|b and b|c, then a|c (for b 6= 0) ;
(e) [a|b and b|a] if and only if a = ±b ;
(f) if a|b and b 6= 0, then |a| ≤ |b| ;
(g) if a|b and a|c, then a|(bx + cy) for any integers x, y.

SOLUTION
(a) Since 0 = 0 × a, it is the case that (∃q ∈ Z)[0 = q.a], so by definition a|0. Since a = 1 × a, it is the
case that (∃q ∈ Z)[a = q.a], so by definition a|a.

1
(b) If a = ±1, then a|1 follows immediately from the definition (namely (∃q ∈ Z)[1 = q.a]). Conversely,
of a|1, then for some q, 1 = q.a, so |1| = |q.a| = |q|.|a|, so |q| = |a| = 1, so in particular a = ±1.
(c) By the assumption, there are integers q, r such that b = q.a and d = r.c. Hence bd = (qa)(rc) =
(qr)(ac), which shows that ac|bd.
(d) By the assumption, there are integers q, r such that b = q.a and c = r.b. Hence c = rb = r(qa) =
(rq)a, which shows that a|c.
(e) If a = ±b, then a = qb and b = ra, where q, r are each one of ±1. So a|b and b|a. Conversely,
if there are q, r such that b = qa and a = rb, then a = rb = rqa, so (canceling the a) 1 = rq, which
implies that q = r = 1 or q = r = −1, so a = ±b.
(f) If b = qa, then |b| = |qa| = |q|.|a|. So, as |q| ≥ 1, |a| ≤ |b|.
(g) If b = qa and c = ra, then bx + cy = bqa + cra = (bq + cr)a, proving that a|(bx + cy)
√
4. Prove that if p is prime, then p is irrational. (You can assume that if p is prime, then whenever p
divides a product ab, p divides at least one of a, b. )

SOLUTION
√ √
We prove the result by contradiction. Suppose p were rational, say p = m/n, where m, n are
natural numbers. We may assume (without loss of generality) that m, n have no common factors.
Then, squaring, p = m2 /n2 , so m2 = pn2 . Thus p|m2 .
Since p is prime, it follows that p|m. Hence m = pq for some natural number q.
Substituting m = pq in the equation m2 = pn2 , we get (pq)2 = pn2 , so p2 q 2 = pn2 , which simplifies to
pq 2 = n2 . Thus p|n2 .
Hence, as p is prime, p|n. Thus p is a common factor of m, n, contrary to the choice of m, n.
This completes the proof.

You might also like