Question 1.

Discussion.
We need to find the x that works and then show that it is the only one. To do the latter step, we assume
both x and y make mx + b = 0 true. Then we use this assumption to conclude that x = y.
b
b
. Notice that m ( m
) + b = b + b = 0. Thus, there exists at
Proof. Consider the real number x = m
least one real number x such that mx + b = 0. To show that such x is unique, we assume that both x and y
make mx + b = 0 true. So mx + b = 0 and my + b = 0, then mx + b = 0 = my + b and mx = my. Dividing
by m, we obtain x = y. Thus there exists a unique x such that mx + b = 0.

Question 2.
Discussion.
We will prove this biconditional statement in two directions. First we shall prove if 1 x 1, then
x2 1. We break x into two cases: 0 x 1 or 1 x < 0 and we prove the statement for the two cases
respectively. Then we shall prove if x2 1, then 1 x 1. Since this statement gives information about
x2 , we should consider the contrapositive, which is if x > 1 or x < 1, then x2 > 1.
Proof. To prove this biconditional statement, we will prove two conditional statements.
First, we consider the statement if 1 x 1, then x2 1. Notice that x falls into one of the
following two cases: 0 x 1 or 1 x < 0. If 0 x 1, we utilize the rule that if a b and c d and
all numbers are non-negative, then ac bd. So we multiply the inequality with itself and have 1 x x 0,
which satifies x2 1. If 1 x < 0, then we can multiply through by 1 and switch the inequality to
obtain 0 < x 1. Multiplying 0 < x 1 by itself again and we yield 1 (x) (x) > 0, and thus
x2 1. Thus, the statement if 1 x 1, then x2 1 is true.
The remaining statement to be proven is if x2 1, then 1 x 1. We will instead prove its
contrapositive if x > 1 or x < 1, then x2 > 1. If x > 1, using the algebraic rule if a > b and c > d and
all numbers are positive, then ac > bdagain, we multiply the inequality with itself and obtain x x > 1,
which is x2 > 1. If x < 1, we multiply through by 1 and switch the inequality to obtain x > 1.
Then multiplying it by itself and we yield (x) (x) > 1, which is x2 > 1. Since we have proven the
contrapositive, the original statement if x2 1, then 1 x 1 is true as well.
Since the two conditional statements are proven, the biconditional statement 1 x 1 if and only if
x2 1 is also proven.
Question 3.
Discussion.
We will prove this biconditional statement in two directions. First we shall prove if m and n have the same
parity, then m + n is even. We prove it for the cases when m and n are both even or odd. Then we will
prove if m + n is even, then m and n have the same parity. We will assume the parity of m and discuss
the parity of n based on the parity of their sum.
Proof. To prove this biconditional statement, we will prove two conditional statements.
First, we consider the statement if m and n have the same parity, then m + n is even. Since integers m
and n have the same parity, they are both even or odd. If they are both even, we can write them as m = 2a
where a is an integer and n = 2b where b is an integer. So m + n = 2a + 2b = 2(a + b) = 2(whole number).
Thus m + n is even. If they are both odd, we can write them as m = 2a + 1 where a is an integer and
n = 2b + 1 where b is an integer. So m + n = 2a + 1 + 2b + 1 = 2(a + b + 1) = 2(whole number). Thus m + n
is even.
The remaining statement to be proven is if m + n is even, then m and n have the same parity. We
consider the cases when m is even and when m is odd. If m is even, we can write it as m = 2a where
a is an integer. And their sum m + n = 2b where b is an integer. So n = m + n m = 2b 2a =
2(b a) = 2(whole number) which is even as well and thus m and n have the same parity. If m is odd, we
can write it as m = 2a + 1 where a is an integer. And their sum m + n = 2b where b is an integer. So

n = m + n m = 2b (2a + 1) = 2(b a) 1 = 2(whole number) 1 which is odd as well and thus m and
n have the same parity.
Since the two conditional statements are proven, the biconditional statement m and n have the same
parity if and only if m + n is even is also proven.
Question 4.
Discussion.
We prove the contrapositive of the statement instead of the original one. The contrapositive is if either m
is even or n is even or both, then m n is even. We express the even number as 2a where a is an integer
and prove this statement.
Proof. We prove the contrapositive of the statement: if either m is even or n is even or both, then m n is
even. Since at least one of them in m and n is even, we write the even number as 2a where a is an integer.
So m n = 2a (whole number) = 2(whole number) which is even.
Since the contrapositive is proven, the original statement If m n is odd, then m and n are both odd
is proven.
Question 5.
(a)
3 = 12 22
1 = 02 12
1 = 12 02
3 = 22 12
5 = 32 22
7 = 42 32
9 = 52 42
(b)
Discussion.
We observe the pattern in (a) and propose that every odd whole number 2k + 1 where k is an integer can
be expressed as (k + 1)2 k 2 .
Proof. For any odd whole number, it can be written as 2k + 1 where k is an integer. Then we find that
(k + 1)2 k 2 = k 2 + 2k + 1 k 2 = 2k + 1. Since both k and k + 1 are integer, we write an arbitrary odd
number as the difference of two perfect squares and the proof is completed.