CSC236 Problem Set 9
There are two components of this problem set: a preliminary question designed to check your understanding of the basic
topics covered this week, and a set of more challenging questions designed to make you think critically about the m

Problem Set 2 Solutions
Preliminary Solution
Proof. We know that m = 14. The predicate we prove is P (n): a combination of 3- and 8-cent coins can total n
cents. We prove that n 14, P (n).
There are three base cases, n = 14, 15, 16. First, P (14) is true

CSC236 Problem Set 4
There are two components of this problem set: a preliminary question designed to check your understanding of the basic
topics covered this week, and a set of more challenging questions designed to make you think critically about the m

CSC236 Problem Set 5
There are two components of this problem set: a preliminary question designed to check your understanding of the basic
topics covered this week, and a set of more challenging questions designed to make you think critically about the m

CSC236 Problem Set 3
There are two components of this problem set: a preliminary question designed to check your understanding of the basic
topics covered this week, and a set of more challenging questions designed to make you think critically about the m

CSC236 Problem Set 6
There are two components of this problem set: a preliminary question designed to check your understanding of the basic
topics covered this week, and a set of more challenging questions designed to make you think critically about the m

CSC236 Problem Set 8
There are two components of this problem set: a preliminary question designed to check your understanding of the basic
topics covered this week, and a set of more challenging questions designed to make you think critically about the m

CSC236 Problem Set 10
There are two components of this problem set: a preliminary question designed to check your understanding of the basic
topics covered this week, and a set of more challenging questions designed to make you think critically about the

CSC236 Problem Set 7
There are two components of this problem set: a preliminary question designed to check your understanding of the basic
topics covered this week, and a set of more challenging questions designed to make you think critically about the m

Problem Set 1 Solutions
Preliminary Solution
Proof. The predicate we will consider is P (n) : the units digit of 4n is either 1, 4, or 6. We will prove that
n N, P (n).
The base case is n = 0; in this case, 40 = 1, and the units digit of 1 is 1, so P (0)