Problem Set 4

Full solutions to these problems are available for free download here:
www.SATPrepGet800.com/PMFBXSG

LEVEL 1
1. The addition and multiplication tables below are defined on the set 𝑆 = {0, 1}. Show that
(𝑆, +, ⋅) does not define a ring.

+ 0 1 ⋅ 0 1
0 0 1 0 1 0
1 1 0 1 0 1

2. Let 𝑆 = {0, 1} and define addition (+) and multiplication (⋅) so that (𝑆, +, ⋅) is a ring. Assume
that 0 is the additive identity in 𝑆 and 1 is the multiplicative identity in 𝑆. Draw the tables for
addition and multiplication and verify that with these tables, (𝑆, +, ⋅) is a ring.

LEVEL 2
3. Use the Principle of Mathematical Induction to prove the following:
(i) 2𝑛 > 𝑛 for all natural numbers 𝑛 ≥ 1.
𝑛(𝑛+1)
(ii) 0 + 1 + 2 + ⋯+ 𝑛 = for all natural numbers.
2

(iii) 𝑛! > 2𝑛 for all natural numbers 𝑛 ≥ 4 (where 𝑛! = 1 ⋅ 2 ⋯ 𝑛 for all natural numbers
𝑛 ≥ 1).
(iv) 2𝑛 ≥ 𝑛2 for all natural numbers 𝑛 ≥ 4.

4. Show that the sum of three integers that are divisible by 5 is divisible by 5.

LEVEL 3
5. Prove that if 𝑎, 𝑏, 𝑐 ∈ ℤ with 𝑎|𝑏 and 𝑏|𝑐, then 𝑎|𝑐.

6. Prove that 𝑛3 − 𝑛 is divisible by 3 for all natural numbers 𝑛.

LEVEL 4
7. Prove that if 𝑎, 𝑏, 𝑐, 𝑑, 𝑒 ∈ ℤ with 𝑎|𝑏 and 𝑎|𝑐, then 𝑎|(𝑑𝑏 + 𝑒𝑐).

8. Prove that 3𝑛 − 1 is even for all natural numbers 𝑛.

 9. Show that Theorem 4.3 (the Principle of Mathematical Induction) is equivalent to the following
statement:
(⋆) Let 𝑃(𝑛) be a statement and suppose that (i) 𝑃(0) is true and (ii) for all 𝑘 ∈ ℕ,
𝑃(𝑘) → 𝑃(𝑘 + 1). Then 𝑃(𝑛) is true for all 𝑛 ∈ ℕ.

LEVEL 5
10. The Principle of Strong Induction is the following statement:
(⋆⋆) Let 𝑃(𝑛) be a statement and suppose that (i) 𝑃(0) is true and (ii) for all 𝑘 ∈ ℕ,
∀𝑗 ≤ 𝑘 (𝑃(𝑗)) → 𝑃(𝑘 + 1). Then 𝑃(𝑛) is true for all 𝑛 ∈ ℕ.

Use the Principle of Mathematical Induction to prove the Principle of Strong Induction.

11. Show that (ℚ, +, ⋅) is a field.

12. Use the Principle of Mathematical Induction to prove that for every 𝑛 ∈ ℕ, if 𝑆 is a set with
|𝑆| = 𝑛, then 𝑆 has 2𝑛 subsets. (Hint: Use Problem 14 from Lesson 2.)