Faculty of Science – Department of Mathematics

19 ive u )
20 n io (c
MTH 314 - Winter 2019

9
on o 1

ity
Problem Set 05
rs Ge -W
Due date : Wednesday, Feb 27, at 8am sharp

rs
g
ye . 14

Submission Guidelines & Clarifications:

r
• Assignments submissions are exclusively accepted online using the course webpage on
3

brightspace. No hardcopies or submissions by email will be accepted.

TH

U
• Your submission needs to be in pdf format, scanned (and not photographed), and
should not exceed 1mb in size. Failure to comply with these guidelines may result in
rejection of your submission.
M
K

• Submission due dates are strict.

• You answers need to be fully justified, unless specified otherwise. Always remember
the WHAT-WHY-HOW rule, namely explain in full detail what you are doing, why
are you doing it, and how are you doing it. Dry yes/no or numerical answers will get
0 marks.
• Assignment submissions will be checked for correctness and completeness, but may not
R

be marked.
• Two different grades will be assigned: 1 when well written solutions to all assignment
questions are submitted, and 0 otherwise.

COPYRIGHT: Reproduction, sharing or online posting of this document, or parts of it,

are strictly forbidden. Ryerson University, K. Georgiou, 2019 (c).

Sharing and/or posting online this manuscript, or parts of it, are strictly forbidden.
(c) K. Georgiou, Ryerson University, 2019
 Page 2 out of 2: Problem Set 05 – MTH 314

Question 1 Determine whether the following statement is true or false. Justify your
answer with a proof or a counterexample.
The difference of the squares of any two consecutive integers is odd.

Question 2 Determine whether the statement is true or false. Prove the statement if it is
true, and give a counterexample if it is false.
(a) A sufficient condition for an integer to be divisible by 8 is that it be divisible by 16.

19 ive u )
20 n io (c
(b) For all integers a, b and c, if a|bc, then a|b or a|c.
(c) For all integers a and b, if a|b then a2 |b2 .

9
on o 1

ity
Question 3 Given any integer n, if n > 3, could n, n + 2 and n + 4 all be prime? Justify
rs Ge -W
your answer. (Hint: use the Quotient-Remainder Theorem, and consider n in the following

rs
form: n = 3q + r.)
g
ye . 14

Question 4 Is the following statement true? Prove or give a counterexample.

r
For all integers n,
3


j n k  n/3 if n mod 3 = 0
TH

= (n − 1)/3 if n mod 3 = 1
U
3
(n − 2)/3 if n mod 3 = 2

M

Question 5 Use proof by contradiction to show that for all integers m, 7m + 4 is not
K

divisible by 7.

Question 6 Prove by contradiction that, for any integer n, n2 − 2 is not divisible by 4.

Question 7 Prove the following statement in two ways: (a) by contraposition and (b) by
contradiction.
R

For all integers a, b, and c, if a 6 |bc, then a 6 |b.

Question 8 For each pair of integers below compute their greatest common divisor.
(a) (812, 122);
(b) (90, −216); and,
(c) (23456789, M ), where M is your student ID.

Reproduction, sharing or online posting of this document,

or parts of it, are strictly forbidden.

Ryerson University, K. Georgiou (c).

Sharing and/or posting online this manuscript, or parts of it, are strictly forbidden.
(c) K. Georgiou, Ryerson University, 2019