Additional exercise

1.3 Proof

1 Prove that the square of any even number is also even.

2 Prove that if 𝑛 is an odd integer then 𝑛2 is also an odd integer

3 Let 𝑥, 𝑦, and 𝑧 be integers. Prove directly that if 𝑥 divides 𝑦 and 𝑥 divides 𝑧, then 𝑥 also divides
𝑦 + 𝑧.
4 Let 𝑚 and 𝑛 be perfect square integers. Show that 𝑚𝑛 is also a perfect square integer.

5 If 𝑛 is an even integer, prove that 7𝑛 + 4 is also an even integer.

6 Show that if 𝑛 is any even integer, then (−1)𝑛 = 1.

7 Prove that for all integers 𝑛, 4(𝑛2 + 𝑛 + 1) − 3𝑛2 is a perfect square.

8 Prove that the product of any two rational numbers is a rational number.

9 Prove that if 𝑎, 𝑏, and 𝑐 are odd integers, then the equation 𝑎𝑥 2 + 𝑏𝑥 + 𝑐 = 0 has no integer
solution.

10 Prove that the statement 3(𝑥 − 2) − 4(3𝑥 + 5) + 2𝑥 − 2 = −7(𝑥 + 4) is true for all values of
x.
𝑥−2 3𝑥−6 𝑥+1
11 a Prove that
𝑥
÷ 𝑥 2 +𝑥 = 3

b For what values of x does this mathematical statement not hold true?

12 Use contraction to show that there exists no integers 𝑛 and 𝑚 for which 18𝑛 + 6𝑚 = 1.

13 Prove that if 𝑎, 𝑏, ∈ ℤ, then 𝑎2 − 4𝑏 ≠ 2.

14 Find a counterexample that disproves the statement “For all 𝑛 ∈ ℝ, 𝑛2 + 4 > 5.

15 Prove by induction: 𝑛! > 3𝑛 for 𝑛 ≥ 7, 𝑛 ∈ ℤ.

16 Prove by induction: (2𝑛)! ≥ 2𝑛 (𝑛!)2 , 𝑛 ∈ ℤ+ .

17 Prove that 4𝑛 + 2 is divisible by 3 for 𝑛 ∈ ℤ+ .

18 Use mathematical induction to prove that 𝑛3 + 11𝑛 is divisible by 3 for 𝑛 ∈ ℤ+ .

19 Prove by induction that 𝑛(𝑛2 + 5) is divisible by 6 for 𝑛 ∈ ℤ+ .

𝑛(𝑛+1)(2𝑛+1)
20 Prove that ∑𝑛𝑖=1 𝑖 2 = , 𝑛 ∈ ℤ+ .
6
1 𝑛
21 Prove that ∑𝑛
𝑖=1 (3𝑖−1)(3𝑖+2) = 6𝑛+4 , 𝑛 ∈ ℤ .
+

22 A sequence is defined by 𝑢1 = 1 and 𝑢𝑛+1 = 2𝑢𝑛 + 1 for all 𝑛 ∈ ℤ+ . Prove that

𝑢𝑛 = 2𝑛 − 1.
23 Prove by induction that the formula for the sum of a finite geometric series holds true for all
𝑛 ∈ ℤ+ . (IB Q)

© Oxford University Press 2019 Additional exercise 1

 Additional exercise

Answers

1 Assume 𝑛 is an even number, ∴ 𝑛 = 2𝑘, for some integer 𝑘. Then

𝑛2 = (2𝑘)2 = 4𝑘 2 = 2(2𝑘 2 ). Since this is divisible by 2, 𝑛2 is even.

2 Assume 𝑛 is an odd integer, ∴ 𝑛 = 2𝑘 + 1, for some integer 𝑘. Then

𝑛2 = (2𝑘 + 1)2
𝑛2 = (2𝑘 + 1)(2𝑘 + 1)

𝑛2 = 4𝑘 2 + 4𝑘 + 1

𝑛2 = 2(2𝑘 2 + 2𝑘) + 1

∴ 𝑛2 is an odd integer.
3 Since 𝑥 divides 𝑦, then 𝑦 = 𝑎𝑥, for some integer 𝑎.

Also, since 𝑥 divides 𝑧, then 𝑧 = 𝑏𝑥, for some integer 𝑏.

𝑦 + 𝑧 = 𝑎𝑥 + 𝑏𝑥 = 𝑥(𝑎 + 𝑏)
Hence 𝑥 divides 𝑦 + 𝑧 since 𝑎 + 𝑏 is an integer.

4 𝑚 = 𝑘 2, for some integer 𝑘 and 𝑛 = 𝑙 2 , for some integer 𝑙.

𝑚𝑛 = 𝑘 2 𝑙 2 = (𝑘𝑙)2

Since 𝑘𝑙 is an integer, 𝑚𝑛 is a perfect square.

5 Assume 𝑛 is an even number, ∴ 𝑛 = 2𝑘, for some integer 𝑘.
Then, 7𝑛 + 4 = 7(2𝑘) + 4
7𝑛 + 4 = 14𝑘 + 4
7𝑛 + 4 = 2(7𝑘 + 2)

Since 𝑘 is an integer, so is 7𝑘 + 2. Since 7𝑛 + 4 is divisible 2, it is an even integer.

6 Assume 𝑛 is an even number, ∴ 𝑛 = 2𝑘, for some integer 𝑘.
(−1)𝑛 = (−1)2𝑘

(−1)𝑛 = ((−1)2 )𝑘

(−1)𝑛 = (1)𝑘
(−1)𝑛 = 1

𝑄𝐸𝐷
7 4(𝑛2 + 𝑛 + 1) − 3𝑛2 = 4𝑛2 + 4𝑛 + 4 − 3𝑛2

4(𝑛2 + 𝑛 + 1) − 3𝑛2 = 𝑛2 + 4𝑛 + 4

4(𝑛2 + 𝑛 + 1) − 3𝑛2 = (𝑛 + 2)(𝑛 + 2)

4(𝑛2 + 𝑛 + 1) − 3𝑛2 = (𝑛 + 2)2

© Oxford University Press 2019 2

 Additional exercise

Since 𝑛 is an integer, 𝑛 + 2 is also an integer and thus 4(𝑛2 + 𝑛 + 1) − 3𝑛2 is a perfect

square.

8 Assume 𝑎 and 𝑏 are rational numbers.

𝑐 𝑒
𝑎 = 𝑑 and 𝑏 = 𝑓 , 𝑑. 𝑓 ≠ 0

𝑐 𝑒 𝑐𝑒
𝑎𝑏 = (𝑑) (𝑓) = 𝑑𝑓

Since 𝑐𝑒 and 𝑑𝑓 are both integers as they are the product of integers, and 𝑑𝑓 ≠ 0 as it is the
product of two non-zero integers, 𝑎𝑏 is a quotient of rational numbers and thus rational.

9 Suppose 𝑎, 𝑏, and 𝑐 are odd integers and the equation 𝑎𝑥 2 + 𝑏𝑥 + 𝑐 = 0 has an integer
solution.

Case 1: 𝑥 is even.
Since the product of an even integers with any integer is even, 𝑎𝑥 2 and 𝑏𝑥 are both even.
Since the sum of two even integers is even,𝑎𝑥 2 + 𝑏𝑥 is also even. Since, 𝑐 is an odd integer
and the sum of an even integer and an odd integer is odd, 𝑎𝑥 2 + 𝑏𝑥 + 𝑐 is odd.

Case 2: 𝑥 is odd.
Since 𝑎, 𝑏, and 𝑐 are odd integers and the product of odd integers is odd, 𝑎𝑥 2 and 𝑏𝑥 are both
odd. Since the sum of two odd integers is even, 𝑎𝑥 2 and 𝑏𝑥 are both even. Since, 𝑐 is an odd
integer and the sum of an even integer and an odd integer is odd, 𝑎𝑥 2 + 𝑏𝑥 + 𝑐 is odd.

Thus, in either case, 𝑎𝑥 2 + 𝑏𝑥 + 𝑐 is odd and hence cannot be equal to 0. Therefore the
equation as no integer solutions.

10 3(𝑥 − 2) − 4(3𝑥 + 5) + 2𝑥 − 2 = −7(𝑥 + 4)

⇔ 3𝑥 − 6 − 12𝑥 − 20 + 2𝑥 − 2 = −7(𝑥 + 4)
⇔ −7𝑥 − 28 = −7(𝑥 + 4)
⇔ −7(𝑥 + 4) = −7(𝑥 + 4)

𝑄𝐸𝐷
𝑥−2 3𝑥−6 𝑥+1
11 a ÷ 𝑥 2 +𝑥 =
𝑥 3

𝑥−2 𝑥 2 +𝑥 𝑥+1
⇔ ∙ 3𝑥−6 =
𝑥 3

𝑥−2 𝑥(𝑥+1) 𝑥+1

⇔ ∙ 3(𝑥−2) =
𝑥 3

1 (𝑥+1) 𝑥+1
⇔1∙ =
3 3
𝑥+1 𝑥+1
⇔ =
3 3

𝑄𝐸𝐷
b 𝑥 ≠ 0, −1, 2.

© Oxford University Press 2019 3

 Additional exercise

12 Assume 𝑛 and 𝑚 are integers.

18𝑛 + 6𝑚 = 1
1
⇒ 3𝑛 + 𝑚 = 6

Since the sum of two integers cannot be between 0 and 1, this is a contradiction and therefore
𝑛 and 𝑚 cannot be integers.

13 Suppose there exists two integers 𝑎 and 𝑏, such that 𝑎2 − 4𝑏 = 2.

𝑎2 = 4𝑏 + 2
𝑎2 = 2(2𝑏 + 1)

∴ 𝑎2 is even and 𝑎 is also even.

∴ 𝑎 = 2𝑘 for some integer 𝑘.

𝑎2 − 4𝑏 = (2𝑘)2 − 4𝑏 = 2

4𝑘 2 − 4𝑏 = 2
2𝑘 2 − 2𝑏 = 1

2(𝑘 2 − 𝑏) = 1

Since 𝑘 2 − 𝑏 is an integer, 1 is therefore even.

Since this is not true, then 𝑎2 − 4𝑏 ≠ 2 by contradiction.

14 Find a counterexample that disproves the statement “For all 𝑛 ∈ ℝ, 𝑛2 + 4 > 5.

If 𝑛 = 0 then 0 + 4 > 5, which is false.
15 If 𝑛 = 7:
7! > 37
⇔ 5040 > 2187
Which is true.

Assume true for 𝑛 = 𝑘:

𝑘! > 3𝑘

Consider 𝑛 = 𝑘 + 1:
(𝑘 + 1)! = (𝑘 + 1)𝑘!

> (𝑘 + 1)3𝑘

> 3 ∙ 3𝑘 (as 𝑘 > 6)

= 3𝑘+1

© Oxford University Press 2019 4

 Additional exercise

Hence, if true for 𝑛 = 𝑘 then also true for 𝑛 = 𝑘 + 1.

As true for 𝑛 = 7, so true for all 𝑛 ≥ 7 by induction.
16 If 𝑛 = 1:

2! ≥ 21 (1!)2
⇔2≥2
Which is true.

Assume true for 𝑛 = 𝑘:

(2𝑘)! ≥ 2𝑘 (𝑘!)2

Consider 𝑛 = 𝑘 + 1:

(2(𝑘 + 1))! = (2𝑘 + 2)(2𝑘 + 1)(2𝑘)!

⇒ (2(𝑘 + 1))! ≥ (2𝑘 + 2)(2𝑘 + 1)(𝑘!)2 2𝑘

= 2(𝑘 + 1)(2𝑘 + 1)(𝑘!)2 2𝑘

> 2𝑘+1 (𝑘 + 1)(𝑘 + 1)(𝑘!)2 since 2𝑘 + 1 > 𝑘 + 1

= 2𝑘+1 ((𝑘 + 1)!)2

Hence, if true for 𝑛 = 𝑘 then also true for 𝑛 = 𝑘 + 1.

As true for 𝑛 = 1, so true for all 𝑛 ≥ 1, 𝑛 ∈ ℤ+ .
17 If 𝑛 = 1:
41 + 2 = 6 = 3(2)
Which is divisible by 3.

Assume true for 𝑛 = 𝑘:

4𝑘 + 2 = 3𝑗, for some integer j

Consider 𝑛 = 𝑘 + 1:

⇔ 4𝑘+1 + 2 = 4 ∙ 4𝑘 + 2

⇔ 4𝑘+1 + 2 = 4(3𝑗 − 2) + 2

⇔ 4𝑘+1 + 2 = 12𝑗 − 8 + 2

⇔ 4𝑘+1 + 2 = 12𝑗 − 6

⇔ 4𝑘+1 + 2 = 3(4𝑗 − 2)
© Oxford University Press 2019 5
 Additional exercise

⇔ 4𝑘+1 + 2 is divisible by 3.

Hence, if true for 𝑛 = 𝑘 then also true for 𝑛 = 𝑘 + 1.

As true for 𝑛 = 1, so true for all 𝑛 ≥ 1, 𝑛 ∈ ℤ+ .
18 If 𝑛 = 1:
13 + 11(1) = 12 = 3(4)
Which is divisible by 3.

Assume true for 𝑛 = 𝑘:

𝑘 3 + 11𝑘 = 3𝑗, for some integer j

Consider 𝑛 = 𝑘 + 1:
(𝑘 + 1)3 + 11(𝑘 + 1) = 𝑘 3 + 3𝑘 2 + 3𝑘 + 11𝑘 + 11

(𝑘 + 1)3 + 11(𝑘 + 1) = 𝑘 3 + 11 + 3𝑘 2 + 3𝑘

(𝑘 + 1)3 + 11(𝑘 + 1) = 3𝑗 + 3𝑘 2 + 3𝑘

(𝑘 + 1)3 + 11(𝑘 + 1) = 3(𝑗 + 𝑘 2 + 𝑘)

(𝑘 + 1)3 + 11(𝑘 + 1) is divisible by 3.

Hence, if true for 𝑛 = 𝑘 then also true for 𝑛 = 𝑘 + 1.

As true for 𝑛 = 1, so true for all 𝑛 ≥ 1, 𝑛 ∈ ℤ+ .
19 If 𝑛 = 1:
1(12 + 5) = 6 = 6(1)
Which is divisible by 6.

Assume true for 𝑛 = 𝑘:

𝑘(𝑘 2 + 5) = 6𝑗, for some integer j.

Consider 𝑛 = 𝑘 + 1:
(𝑘 + 1)((𝑘 + 1)2 + 5) = (𝑘 + 1)(𝑘 2 + 2𝑘 + 6)

(𝑘 + 1)((𝑘 + 1)2 + 5) = 𝑘 3 + 2𝑘 2 + 6𝑘 + 𝑘 2 + 2𝑘 + 6

(𝑘 + 1)((𝑘 + 1)2 + 5) = 𝑘 3 + 3𝑘 2 + 8𝑘 + 6
(𝑘 + 1)((𝑘 + 1)2 + 5) = (𝑘 3 + 5𝑘) + (3𝑘 2 + 3𝑘 + 6)

© Oxford University Press 2019 6

 Additional exercise

(𝑘 + 1)((𝑘 + 1)2 + 5) = 𝑘(𝑘 2 + 5) + (3𝑘 2 + 3𝑘 + 6)

(𝑘 + 1)((𝑘 + 1)2 + 5) = 6𝑗 + 3𝑘(𝑘 + 1) + 6

Since 𝑘(𝑘 + 1) is even, all three terms are divisible by 6.

Hence, if true for 𝑛 = 𝑘 then also true for 𝑛 = 𝑘 + 1.

As true for 𝑛 = 1, so true for all 𝑛 ≥ 1, 𝑛 ∈ ℤ+ .

20 If 𝑛 = 1:
1(1+1)(2(1)+1)
12 = 6

1(2)(3)
⇔1= 6
6
⇔1=6

⇔1=1
Which is true.

Assume true for 𝑛 = 𝑘:

𝑘(𝑘+1)(2𝑘+1)
∑𝑘𝑖=1 𝑖 2 =
6

Consider 𝑛 = 𝑘 + 1:
(𝑘+1)(𝑘+2)(2(𝑘+1)+1) (𝑘+1)(𝑘+2)(2𝑘+3)
We need to show that ∑𝑘+1 2
𝑖=1 𝑖 = = .
6 6

∑𝑘+1 2 𝑘 2
𝑖=1 𝑖 = ∑𝑖=1 𝑖 + (𝑘 + 1)
2

𝑘(𝑘+1)(2𝑘+1)
⇔ ∑𝑘+1 2
𝑖=1 𝑖 = 6
+ (𝑘 + 1)2

𝑘(𝑘+1)(2𝑘+1) 6(𝑘+1)2
⇔ ∑𝑘+1 2
𝑖=1 𝑖 = 6
+ 6

𝑘(2𝑘 2 +3𝑘+1)+6(𝑘 2 +2𝑘+1)

⇔ ∑𝑘+1 2
𝑖=1 𝑖 = 6

2𝑘 3 +3𝑘 2 +𝑘+6𝑘 2 +12𝑘+6

⇔ ∑𝑘+1 2
𝑖=1 𝑖 = 6

2𝑘 3 +9𝑘 2 +𝑘+13𝑘+6
⇔ ∑𝑘+1 2
𝑖=1 𝑖 = 6

(2𝑘+3)(𝑘+1)(𝑘+2)
⇔ ∑𝑘+1 2
𝑖=1 𝑖 = 6

𝑄𝐸𝐷

Hence, if true for 𝑛 = 𝑘 then also true for 𝑛 = 𝑘 + 1.

© Oxford University Press 2019 7

 Additional exercise

As true for 𝑛 = 1, so true for all 𝑛 ≥ 1, 𝑛 ∈ ℤ+ .

21 If 𝑛 = 1:
1 1
∑1𝑖=1 = 6(1)+4
(3(1)−1)(3(1)+2)

1 1
⇔ ∑1𝑖=1 (3−1)(3+2) = 6+4

1 1
⇔ ∑1𝑖=1 (2)(5) = 10

1 1
⇔ ∑1𝑖=1 10 = 10

Which is true.

Assume true for 𝑛 = 𝑘:

1 𝑘
∑𝑘𝑖=1 = 6𝑘+4
(3𝑖−1)(3𝑖+2)

Consider 𝑛 = 𝑘 + 1:

We want to show that

1 𝑘+1 𝑘+1 𝑘+1
∑𝑘+1
𝑖=1 = 6(𝑘+1)+4 = 6𝑘+10 = 2(3𝑘+5)
(3𝑖−1)(3𝑖+2)

1 1 1
∑𝑘+1
𝑖=1 = ∑𝑘𝑖=1 (3𝑖−1)(3𝑖+2) + (3(𝑘+1)−1)(3(𝑘+1)+2)
(3𝑖−1)(3𝑖+2)

1 𝑘 1
⇔ ∑𝑘+1
𝑖=1 (3𝑖−1)(3𝑖+2) = 6𝑘+4 + (3𝑘+3−1)(3𝑘+3+2)

1 𝑘 1
⇔ ∑𝑘+1
𝑖=1 (3𝑖−1)(3𝑖+2) = 2(3𝑘+2) + (3𝑘+2)(3𝑘+5)

1 𝑘(3𝑘+5) 2
⇔ ∑𝑘+1
𝑖=1 (3𝑖−1)(3𝑖+2) = 2(3𝑘+2)(3𝑘+5) + 2(3𝑘+2)(3𝑘+5)

1 3𝑘 2 +5𝑘+2
⇔ ∑𝑘+1
𝑖=1 (3𝑖−1)(3𝑖+2) = 2(3𝑘+2)(3𝑘+5)

1 (3𝑘+2)(𝑘+1)
⇔ ∑𝑘+1
𝑖=1 (3𝑖−1)(3𝑖+2) = 2(3𝑘+2)(3𝑘+5)

1 𝑘+1
⇔ ∑𝑘+1
𝑖=1 (3𝑖−1)(3𝑖+2) = 2(3𝑘+5)

Hence, if true for 𝑛 = 𝑘 then also true for 𝑛 = 𝑘 + 1.

𝑛 = 1, so true for all 𝑛 ≥ 1, 𝑛 ∈ ℤ+ .
As true for
22 A sequence is defined by 𝑢1 = 1 and 𝑢𝑛+1 = 2𝑢𝑛 + 1 for all 𝑛 ∈ ℤ+ . Prove that

𝑢𝑛 = 2𝑛 − 1.

© Oxford University Press 2019 8

 Additional exercise

If 𝑛 = 2:
𝑢2 = 2(𝑢1 ) + 1 = 3

22 − 1 = 3
Assume true for 𝑛 = 𝑘:

𝑢 𝑘 = 2𝑘 − 1

Consider 𝑛 = 𝑘 + 1:

We want to prove that 𝑢𝑘+1 = 2𝑘+1 − 1.

𝑢𝑘+1 = 2𝑢𝑘 + 1

⇒ 𝑢𝑘+1 = 2(2𝑘 − 1) + 1

⇒ 𝑢𝑘+1 = 2𝑘+1 − 2 + 1

⇒ 𝑢𝑘+1 = 2𝑘+1 − 1

Hence, if true for 𝑛 = 𝑘 then also true for 𝑛 = 𝑘 + 1.

As true for 𝑛 = 1, so true for all 𝑛 ≥ 1, 𝑛 ∈ ℤ+ .

𝑎(1−𝑟 𝑛 )
23 We want to prove that 𝑎 + 𝑎𝑟 + 𝑎𝑟 2 + 𝑎𝑟 3 + ⋯ + 𝑎𝑟 𝑛−1 =
1−𝑟

If 𝑛 = 1:
𝑎(1−𝑟 1 )
𝑎= 1−𝑟

⇔𝑎=𝑎
Which is true.

Assume true for 𝑛 = 𝑘:

𝑎(1−𝑟 𝑘 )
𝑎 + 𝑎𝑟 + 𝑎𝑟 2 + 𝑎𝑟 3 + ⋯ + 𝑎𝑟 𝑘−1 = 1−𝑟

Consider 𝑛 = 𝑘 + 1:
𝑎(1−𝑟 𝑘 )
𝑎 + 𝑎𝑟 + 𝑎𝑟 2 + 𝑎𝑟 3 + ⋯ + 𝑎𝑟 𝑘−1 + 𝑎𝑟 𝑘 = 1−𝑟
+ 𝑎𝑟 𝑘

𝑎(1−𝑟 𝑘 ) 𝑎𝑟 𝑘 (1−𝑟)
= 1−𝑟
+ 1−𝑟

𝑎−𝑎𝑟 𝑘 +𝑎𝑟 𝑘 −𝑎𝑟 𝑘+1

= 1−𝑟

© Oxford University Press 2019 9

 Additional exercise

𝑎−𝑎𝑟 𝑘+1
=
1−𝑟

𝑎(1−𝑟 𝑘+1 )
= 1−𝑟

Hence, if true for 𝑛 = 𝑘 then also true for 𝑛 = 𝑘 + 1.

As true for 𝑛 = 1, so true for all 𝑛 ≥ 1, 𝑛 ∈ ℤ+ .

© Oxford University Press 2019 10