Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai

Chapter 3
Xuan Toan, Tran Hong
Tai

Proving methods
Discrete Structures for Computing on June 16, 2024
Contents
Proving Methods
Exercise

Nguyen An Khuong, Tran Tuan Anh, Mai Xuan Toan, Tran Hong
Tai
Faculty of Computer Science and Engineering
University of Technology - VNUHCM
[email protected]
3.1
Contents Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

1 Proving Methods Contents

Proving Methods
Exercise

2 Exercise

3.2
Course outcomes Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Course learning outcomes

L.O.1 Understanding of logic and discrete structures
L.O.1.1  Describe definition of propositional and predicate logic
L.O.1.2  Define basic discrete structures: set, mapping, graphs
Contents
L.O.2 Represent and model practical problems with discrete structures
L.O.2.1  Logically describe some problems arising in Computing Proving Methods
L.O.2.2  Use proving methods: direct, contrapositive, induction Exercise
L.O.2.3  Explain problem modeling using discrete structures

L.O.3 Understanding of basic probability and random variables

L.O.3.1  Define basic probability theory
L.O.3.2  Explain discrete random variables

L.O.4 Compute quantities of discrete structures and probabilities

L.O.4.1  Operate (compute/ optimize) on discrete structures
L.O.4.2  Compute probabilities of various events, conditional
ones, Bayes theorem

3.3
Introduction Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Definition Contents

A proof is a sequence of logical deductions from Proving Methods

Exercise
- axioms, and
- previously proved theorems
that concludes with a new theorem.

3.4
Terminology Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Contents
Proving Methods
Exercise

• Theorem (ành lþ ) = a statement that can be shown to be

true

• Axiom (ti¶n · ) = a statement we assume to be true

• Hypothesis (gi£ thi¸t ) = the premises of the theorem

3.5
 Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Contents
Proving Methods

• Lemma (bê · ) = less important theorem that is helpful in Exercise

the proofs of other results

• Corollary (h» qu£ ) = a theorem that can be established

directly from a proved theorem

• Conjecture (phäng o¡n) = statement being proposed to be

true, when it is proved, it becomes theorem

3.6
Proving a Theorem Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Many theorem has the form ∀xP (x) → Q(x)

Contents
Goal: Proving Methods

• Exercise
Show that P (c) → Q(c) is true with arbitrary c of the domain

• Apply universal generalization

⇒ How to show that conditional statement p→q is true.

3.7
Methods of Proof Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

• Direct proofs (chùng

minh trüc ti¸p ) Contents
Proving Methods
• Proof by contraposition (chùng minh ph£n £o )
Exercise
• Proof by contradiction (chùng minh ph£n chùng )
• Mathematical induction (quy n¤p to¡n håc )

3.8
Direct Proofs Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Definition
A direct proof shows that p→q is true by showing that if p is
true, then q must also be true. Contents
Proving Methods
Exercise
Example
Ex.: If n is an odd integer, then n2 is odd.

Pr.: Assume thatn is odd. By the definition, n = 2k + 1, k ∈ Z.

n2 = (2k + 1)2 = 4k 2 + 4k + 1 = 2(2k 2 + 2k) + 1 is an odd
number.

3.9
Proof by Contraposition Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Definition
p → q can be proved by showing (directly) that its contrapositive,
¬q → ¬p, is true. Contents
Proving Methods
Example Exercise

Ex.: Given an integer n, show that if 3n + 2 is odd, then n is odd.

n = 2k , k ∈ Z. Substituting
Pr.: Assume that  n is even, so
3n + 2 = 3(2k) + 2 = 6k + 2 = 2(3k + 1) is even. Because
the negation of the conclusion of the conditional statement
implies that the hypothesis is false, Q.E.D.

3.10
Proofs by Contradiction Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Definition
p is true if if can show that ¬p → (r ∧ ¬r) is true for some
proposition r.
Contents
Example Proving Methods
√ Exercise
Ex.: Prove that 2 is irrational.
√
Pr.: Let p is the proposition 
√ 2 ¬p is true,
is irrational. Suppose
√
which means 2 ∃a, b ∈ Z, 2 = a/b, a, b
is rational. If so,
2 2 2 2
have no common factors. Squared, 2 = a /b , 2b = a , so
2
a is even, and a is even, too. Because of that a = 2c, c ∈ Z.
2 2 2 2 2
Thus, 2b = 4c , or b = 2c , which means b is even and so
is b. That means 2 divides both a and b, contradict with the
assumption.

3.11
Problem Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Contents
Proving Methods
Exercise

Assume that we have an infinite domino string, we want to know

whether every dominoes will fall, if we only know two things:

1 We can push the first domino to fall

2 If a domino falls, the next one will be fall

We can! Mathematical induction.

3.12
Mathematical Induction Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Definition (Induction)
To prove that P (n) is true for all positive integers n, where P (n)
is a propositional function, we complete two steps: Contents

• Basis Step: Verify that P (1) is true. Proving Methods

Exercise
• Inductive Step: Show that the conditional statement
P (k) → P (k + 1) is true for all positive integers k
Logic form:

[P (1) ∧ ∀kP (k) → P (k + 1))] → ∀nP (n)

What is P (n) in domino string case?

3.13
Example on Induction Proving methods

Nguyen An Khuong,

Example Tran Tuan Anh, Mai

Xuan Toan, Tran Hong
Tai

Show that if n is a positive integer, then

n(n + 1)
1 + 2 + ... + n = .
2

Contents
Solution Proving Methods
Let P (n) be the proposition that sum of first n is n(n + 1)/2 Exercise
1(1+1)
• Basis Step: P (1) is true, because 1= 2
• Inductive Step:
k(k+1)
Assume that 1 + 2 + ... + k = 2 .
Then:

k(k + 1)
1 + 2 + . . . + k + (k + 1) = + (k + 1)
2
k(k + 1) + 2(k + 1)
=
2
(k + 1)(k + 2)
=
2 3.14
Example on Induction Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Example
Prove that n < 2n for all positive integers n.

Solution
n Contents
Let P (n) be the proposition that n < 2 .
Proving Methods
• Basis Step: P (1) is true, because 1 < 21 = 2 Exercise

• Inductive Step:
Assume that P (k) is true for the positive k , that is, k < 2k .
k k
Add 1 to both side of k < 2 , note that 1 ≤ 2 .

k + 1 < 2k + 1 ≤ 2k + 2k = 2 · 2k = 2k+1 .

shows that P (k + 1) is true, namely, that k + 1 < 2k+1 ,

based on the assumption that P (k) is true.

3.15
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Prove that, if n is a non-negative integer and 7n + 9 is an even

Contents
number, then n is an odd number by three ways:
Proving Methods
1 Directed proof. Exercise

2 Contraposition proof(ph£n £o).

3 Contradiction.

3.16
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Directed proof
Assume: 7n + 9 is the even number. Then, 7n + 9 = 2k, (k ∈ Z)
So: n = 2k − 6n − 9 = 2k − 6n − 10 + 1 = 2(k − 3n − 5) + 1
That means n is an odd number.

Contrapositive proof (ph£n £o) Contents

To proof the above statement, firstly, we convert it into the logic expression: p → q with Proving Methods
p = 7n + 9 is the even number and q = n is the odd number.
Its contrapositive: "If n is not an odd number, then 7n + 9 is not an even number". We Exercise
can prove this statement follows this way:
If n is not an odd number, that means n can divisible 2. So that, n = 2k, (k ∈ Z)
We imply: 7n + 9 = 7(2k) + 9 = 14k + 9 = 2(7k + 4) + 1
That means: 7n + 9 is not the even number. Totally, we have proved the logic expression:
¬q → ¬p. Therefore p → q is also truth.

Contradiction proof
Suppose 7n + 9 is an even number and n is not an odd number or n is an even number.
Because n is an even number, then n = 2k, (k ∈ Z)
We infer: 7n + 9 = 7(2k) + 9 = 14k + 9 = 2(7k + 4) + 1
Its means: 7n + 9 is the odd number. We can show that, if n is an even number, then
7n + 9 is an odd number. This contradicts with the hypothesis 7n + 9 is an even number.

3.17
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Which of the method of proof is used for proving the statement

below:
To prove "If m and n are integers, m × n is an even number, then
either m is even or n is even", we follow these inferences: Contents

Assume m and n are odd numbers. Then we can express: m = 2k + 1

Proving Methods

and n = 2l + 1. So mn = (2k + 1)(2l + 1) = 2(2kl + k + l) + 1 is the

Exercise

odd number. Contradiction. That means either m is even or n even.

A) Directed proof.

B) Contradiction proof or contra-positive proof

C) inductive proof

D) All the above answers are incorrect.

3.18
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Which of the method of proof is used for proving the statement

below:
To prove "If m and n are integers, m × n is an even number, then
either m is even or n is even", we follow these inferences: Contents

Assume m and n are odd numbers. Then we can express: m = 2k + 1

Proving Methods

and n = 2l + 1. So mn = (2k + 1)(2l + 1) = 2(2kl + k + l) + 1 is the

Exercise

odd number. Contradiction. That means either m is even or n even.

A) Directed proof.

B) Contradiction proof or contra-positive proof correct answer!

C) inductive proof

D) All the above answers are incorrect.

3.18
 Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai

What is wrong in the following induction to prove that all flowers Xuan Toan, Tran Hong
Tai

are the same color?

(1) Let P (n) be all flowers in a set of n flowers have the same
color.

(2) We can easily infer that, P (1) is a truth.

(3) Assume that P (n) is correct. Which means that all flowers in Contents
the set of n flowers have the same color . Proving Methods
Exercise
(4) Consider a set of n+1 flowers; numbering as
1, 2, 3, . . . , n, (n + 1).
(5) Based on the assumption, Sequence of first n flowers has the
same color, and sequence of n later flowers also has the same
color.

(6) Because the 2 set has same n−1 flowers, all n+1 flowers
should have a same color.

(7) Meaning P (n + 1) and the statement is proved by induction.

3.19
 Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Consider a subset D (N × N ) which defined in a recursive way:

(i) (n, 0) ∈ D.
(ii) If (n, m) ∈ D, (n, n + m) ∈ D. Contents
Proving Methods
Do
Exercise
1) Calculate some elements from D.
2) prove by induction on k that 'if m = k.n, '(n, m) ∈ D'.
3) prove that if (n, m) ∈ D, we will get m = kn k ∈ N .

3.20
 Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

∀n ∈ N +
a) Prove that
(n + 1) − (n + 2)2 − (n + 3)2 + (n + 4)2 = 4.
2
Contents
b) The infer that for every natural number m, there exists
Proving Methods
natural number n that can represent m as a sum of squares
2 2 2 + + Exercise
1 , 2 , . . ., n , which mean: ∀m ∈ N , ∃n ∈ N ,
∃ε1 , . . . , εn ∈ {−1, 1}, m = ε1 12 + ε2 22 + . . . + εn n2 .
(Hint: Try to display the values of m ∈ {1, 2, 3, 4, 5, 6})

3.21
 Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai

+
a) Prove that ∀n ∈ N Xuan Toan, Tran Hong
Tai

(n + 1)2 − (n + 2)2 − (n + 3)2 + (n + 4)2 = 4.

b) The infer that for every natural number m, there exists
natural number n that can represent m as a sum of squares
12 , 22 , . . ., n2 , which mean: ∀m ∈ N + , ∃n ∈ N + ,
∃ε1 , . . . , εn ∈ {−1, 1}, m = ε1 12 + ε2 22 + . . . + εn n2 . Contents
(Hint: Try to display the values of m ∈ {1, 2, 3, 4, 5, 6}) Proving Methods
Exercise
• m = 0: 0 = 1 + 2 − 3 + 4 − 5 − 6 + 7
2 2 2 2 2 2 2

• m = 1: 1 = 12
• m = 2: 2 = −12 − 22 − 32 + 42
• m = 3: 3 = −12 + 22
• m = 4: 4 = 12 − 22 − 32 + 42

3.21
 Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai

+
a) Prove that ∀n ∈ N Xuan Toan, Tran Hong
Tai

(n + 1)2 − (n + 2)2 − (n + 3)2 + (n + 4)2 = 4.

b) The infer that for every natural number m, there exists
natural number n that can represent m as a sum of squares
12 , 22 , . . ., n2 , which mean: ∀m ∈ N + , ∃n ∈ N + ,
∃ε1 , . . . , εn ∈ {−1, 1}, m = ε1 12 + ε2 22 + . . . + εn n2 . Contents
(Hint: Try to display the values of m ∈ {1, 2, 3, 4, 5, 6}) Proving Methods
Exercise
• m = 0: 0 = 1 + 2 − 3 + 4 − 5 − 6 + 7
2 2 2 2 2 2 2

• m = 1: 1 = 12
• m = 2: 2 = −12 − 22 − 32 + 42
• m = 3: 3 = −12 + 22
• m = 4: 4 = 12 − 22 − 32 + 42
• m = 5: 5 = 12 + (22 − 32 − 42 + 52 )

3.21
 Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai

+
a) Prove that ∀n ∈ N Xuan Toan, Tran Hong
Tai

(n + 1)2 − (n + 2)2 − (n + 3)2 + (n + 4)2 = 4.

b) The infer that for every natural number m, there exists
natural number n that can represent m as a sum of squares
12 , 22 , . . ., n2 , which mean: ∀m ∈ N + , ∃n ∈ N + ,
∃ε1 , . . . , εn ∈ {−1, 1}, m = ε1 12 + ε2 22 + . . . + εn n2 . Contents
(Hint: Try to display the values of m ∈ {1, 2, 3, 4, 5, 6}) Proving Methods
Exercise
• m = 0: 0 = 1 + 2 − 3 + 4 − 5 − 6 + 7
2 2 2 2 2 2 2

• m = 1: 1 = 12
• m = 2: 2 = −12 − 22 − 32 + 42
• m = 3: 3 = −12 + 22
• m = 4: 4 = 12 − 22 − 32 + 42
• m = 5: 5 = 12 + (22 − 32 − 42 + 52 )
• m = 6: 6 = −12 − 22 − 32 + 42 + (52 − 62 − 72 + 82 )

3.21
 Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Prove the following:

1 1.2 + 2.5 + 3.8 + . . . + n.(3n − 1) = n2 (n + 1), n ≥ 1 Contents

1 1 1 2n
2 1 + 1+2 + 1+2+3 + ... + 1+2+3+...+n = n+1 , n ≥1 Proving Methods
Pn i−1 n Exercise
3 i=1 2 =2 −1
4 log5 (2) is an irrational number.

3.22
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

(1) 1.2 + 2.5 + 3.8 + . . . + n.(3n − 1) = n2 (n + 1), n ≥ 1 (1)

2
- With n = 1 we have 1.2 = 1 (1 + 1) → (1) correct.
- Assume (1) is correct with n = k , then we have
1.2 + 2.5 + 3.8 + . . . + k.(3k − 1) = k 2 (k + 1) Contents

- We will prove (1) is correct with n = k + 1, meaning

Proving Methods
Exercise
1.2+2.5+3.8+. . .+k.(3k−1)+(k+1)(3k+2) = (k+1)2 (k+2).
In fact, n = k + 1, meaning
1.2 + 2.5 + 3.8 + . . . + k.(3k − 1) + (k + 1)(3k + 2) =
[1.2 + 2.5 + 3.8 + . . . + k.(3k − 1)] + (k + 1)(3k + 2) =
k 2 (k + 1) + (k + 1)(3k + 2) = (k + 1)(k 2 + 3k + 2) =
(k + 1)(k + 1)(k + 2) = (k + 1)2 (k + 2).
The expression is correct with n = k + 1.Thus, QED.

3.23
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

1 1 1 2n
(2) 1+ 1+2 + 1+2+3 + . . . + 1+2+3+...+n = n+1 , n ≥ 1 (2)
2
- With n = 1 we have P(1): 1 =
1+1 → (2) correct.
- Assume (2) is correct with n = k , Then we have P(k):
1+ 1
+ 1
+ . . . + 1 2k Contents
1+2 1+2+3 1+2+3+...+k = k+1
Proving Methods
- We will prove (2) is correct with n = k + 1, meaning
Exercise
P(k+1):
1 1 1 1
1+ 1+2 + 1+2+3 + . . . + 1+2+3+...+k + 1+2+...+k+(k+1) =
2k 1 2k 2 2k(k+2)+2
k+1 + 1+2+...+k+(k+1) = k+1 + (k+1)(k+2) = (k+1)(k+2) =
2 2
2(k +2k+1) 2(k+1) 2(k+1)
(k+1)(k+2) = (k+1)(k+2) = k+2 [ Noted that:
1 + 2 + . . . + k + (k + 1) = (k+1)(k+2)
2 ]
The expression is correct with n = k + 1.Thus, QED.

3.24
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Pn i−1 n
(3) i=1 2 = 2 − 1 (3)
P1 i−1
- With i = 1 we have S(1): i=1 2 = 21−1 = 21 − 1 →
(3) correct.
- Assume (3) is correct with n = k, Then we have S(k):
Contents
Pk i−1
i=1 2 = 2k − 1
Proving Methods
- We will prove (3) is correct with n = k + 1, meaning
Exercise
S(k+1):
Pk+1 i−1
Pk
i=1 2 = i=1 2i−1 + 2k = 2k − 1 + 2k = 2k+1 − 1
The expression is correct with n = k + 1.
(4) Prove that log5 (2) is an irrational number.
Assume the opposite log5 (2) is a rational number. Therefore,
log5 (2) = ab , where a, b ∈ Z, b ̸= 0, GCD(a,b) = 1
a √
Then, 5 b =
b
5a = 2 ⇔ 5a = 2b . Because 5a is always odd
b
and 2 is always even. So, this is a contradiction. Thus, QED.

3.25
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Prove the following statements by induction:

1 For every integer n ≥ 1, 32n−1 + 1 is divisible by 4. Contents

n Proving Methods
2 For every integer n ≥ 1, 6 − 1 is divisible by 5. Exercise
3 For every integer n ≥ 1, 52n−1 + 1 is divisible by 6.
4 For every integer n ≥ 1, 8n − 1 is divisible by 7.
n
5 For every integer n ≥ 1, 4 + 15n − 1 is divisible by 9.

3.26
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

(1) Prove that for every integer n ≥ 1, 32n−1 + 1 is divisible by 4.

.
With n= 1, we have 4..4 - Truth.
On the other hand, There is an integer k≥1 so that
Contents
32k−1 + 1 is divisible by 4. Proving Methods
On the other hand, There is an integer m so that
Exercise
32k−1 + 1 = 4m.
We need to prove 32(k+1)−1 + 1 is divisible by 4.
2k+1
This is the equivalent to prove 3 + 1 is divisible by 4.
On the other hand, we have:
32k+1 +1 = 32 (32k−1 +9−8 = 9(32k−1 +1)−2.4 = 4(9m+2).
2k+1
Therefore, 3 + 1 is a multiple of 4. The above statement
is proved by induction

3.27
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

(2) Prove that for every integer n ≥ 1, 6n − 1 is divisible by 5.

.
With n = 1, we have 61 − 1 = 5..5 - Truth.
On the other hand, There is an integer n≥1 so that 6n − 1 Contents
is divisible by 5. Proving Methods
On the other hand, There is an integer m so that Exercise
n
6 − 1 = 5m.
We need to prove 6n+1 − 1 is divisible by 5.
On the other hand, we have:
6n+1 −1 = 6.6n −6+5 = 6(6n −1)+5 = 30m+5 = 5(6m+1).
n+1
Therefore, 6 − 1 is a multiple of 5. The above statement
is proved by induction.

3.28
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

(3) Prove that for every integer n ≥ 1, 52n−1 + 1 is divisible by 6.

.
With n = 1, we have 52−1 + 1 = 4..4 - Truth.
Assume there is an integer n ≥ 1 so that 52n−1 + 1 is
Contents
divisible by 6. Proving Methods
On the other hand, There is an integer m so that
Exercise
52n−1 + 1 = 6m.
We have to prove 52(n+1)−1 + 1 is divisible by 6.
2n+1
This is the equivalent to prove 5 + 1 is divisible by 6.
On the other hand, we have:
52n+1 − 1 = 52 .52n−1 + 25 − 24 = 52 (52n−1 + 1) − 24 =
150m − 24 = 6(25m − 4). Therefore, 52n−1 + 1 is a multiple
of 6. The above statement is proved by induction.

3.29
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

(4) Prove that for every integer n ≥ 1, 8n − 1 is divisible by 7.

.
With n = 1, we have81 − 1 = 7..7 - Truth.
Contents
Assume there is an integer n ≥ 1 so that 8n − 1 is divisible by
Proving Methods
7.
n Exercise
In other word, there exists an integer m so that 8 − 1 = 7m.
We need to prove that 8n+1 − 1 is also divisible by 7.
On the other hand, We have:
8n+1 −1 = 8.8n −8+7 = 8(8n −1)+7 = 56m+7 = 7(8m+1).
n+1
Thus, 8 − 1 is also a multiple of 7. The above statement
is proved by induction.

3.30
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

(5) Prove that for all integers n ≥ 1, 4n + 15n − 1 are divisible by

9.
. Contents
With n = 1, we has41 + 15 − 1 = 18..9 - Always true. Proving Methods
n
Assume there is an integer n ≥ 1 so that 4 + 15n − 1 is Exercise
divisible by 9
In other word, There is an integer m so that
4n + 15n − 1 = 9m
We need to prove that 4n+1 + 15(n + 1) − 1 is also divisible
by 9.

3.31
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

On the other hand, we have:

4n+1 + 15(n + 1) − 1 = 4n .41 + 15n + 15 − 1 =
3.4n + 4n + 15n + 15 − 1 = (4n + 15n − 1) + 3.4n + 15
.
In which: (4n + 15n − 1)..9 (based on the assumption)
Contents
And: For 3.4n + 15 = 3(4n + 5) divisible by 9, we need to prove
Proving Methods
.
(4n + 5)..3 Exercise
.
Let B(k) = 4k + 5. With k = 1, 41 + 5 = 9..3 → correct with k=1
.
Assume it is also true with k = i → B(i) = (41 + 5)..3. We prove
that it is also correct with k = i + 1 → B(i+1) =
4i+1 + 5 = 4i .4 + 5 = 3.4i + 4i + 5 = (4i + 5) + 3.4i . We have:
.
(4i + 5)..3 based on the assumption
. .
And: 3.4i ..3. Therefore, (4n + 5)..3. thus, QED.

3.32
 Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Prove the following inequalities by induction:

Contents
1 For every integer n ≥ 1, 3n > n2 . Proving Methods
2 For every integer n ≥ 4, n! > 2n . Exercise

3.33
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

n 2
(1) Prove that for every integer n ≥ 1, 3 > n .
with n = 1, 31 = 3 v 12 = 1. Therefore, the
we have
statement is correct for n = 1.
2 2
With n = 2, we have 3 = 9 and 2 = 4. Therefore, the
statement is also correct with n = 2. Contents
n 2
Assume there is an integer n ≥ 2 that 3 > n . Proving Methods
We need to prove 3
n+1 2
is greater than (n + 1) . Exercise

On the other hand, Expanding the right side of the inequality,

we get:(n + 1)2 = n2 + 2n + 1.
2
Because we only consider n ≥ 2, n = n × n ≥ 2n and
n
3 > 1.
Consider the left side of the inequality:
3n+1 = 3 × 3n = 3n + 3n + 3n > n2 + n2 + 1 >
n2 + 2n + 1 = (n + 1)2 (QED)
. Thus, The statement is proved by induction.

3.34
Solution Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

(2) Prove that for every integern ≥ 4, n! > 2n .

4
with n = 4, we have 4! = 24 > 2 = 16.
n
Assume there is an integer n ≥ 1 that n! > 2 . Contents
n+1 Proving Methods
We need to prove that (n + 1)! is greater than 2 .
On the other hand, we have: Exercise

(n + 1)! = (n + 1) × n!. based on the assumption, we have:

(n + 1)! > (n + 1) × 2n .
Moreover, the expression on the right side is greater than
2 × 2n = 2n+1 (v¼ n ≥ 4 > 2) because of that, the above
statement is proved by induction.

3.35
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Find the following values f (1), f (2) f (3) knowing

and that f (n)
is defined in the a recursive way with f (0) = 1 and Contents
f (n + 1) = f (n)2 + f (n) + 1, n = 0, 1, 2, . . . Proving Methods
Exercise
A) 1, 3, 13

B) 1, 3, 10

C) 3, 10, 111

D) 3, 13, 173

E) None of the above

3.36
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Find the following values f (1), f (2) f (3) knowing

and that f (n)
is defined in the a recursive way with f (0) = 1 and Contents
f (n + 1) = f (n)2 + f (n) + 1, n = 0, 1, 2, . . . Proving Methods
Exercise
A) 1, 3, 13

B) 1, 3, 10

C) 3, 10, 111

D) 3, 13, 173

E) None of the above correct answer!

3.36
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

A sequence {t(n)}n is defined by a recursive formula:

t(n) + t(n − 1) − 6 t(n − 2) = 0 (t ≥ 3),

Contents
Knowing that t(1) = 1, t(2) = 3. The Explicit formula for the
Proving Methods
sequence is:
Exercise
3 1
A) t(n) = · 2n + · (−3)n
5 15
3 7
B) t(n) = · 2n + · (−3)n
5 15
7
C) t(n) = 3 · (−2)n + · 3n
3
5
D) t(n) = −3 · 2 + · (−3)n
n
3
E) None of the above

3.37
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

A sequence {t(n)}n is defined by a recursive formula:

t(n) + t(n − 1) − 6 t(n − 2) = 0 (t ≥ 3),

Contents
Knowing that t(1) = 1, t(2) = 3. The Explicit formula for the
Proving Methods
sequence is:
Exercise
3 1
A) t(n) = · 2n + · (−3)n correct answer!
5 15
3 7
B) t(n) = · 2n + · (−3)n
5 15
7
C) t(n) = 3 · (−2)n + · 3n
3
5
D) t(n) = −3 · 2 + · (−3)n
n
3
E) None of the above

3.37
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Find the first six numbers of the sequence defined by the following
recursive formula.
Contents
a0 = −1, an = −2an−1 Proving Methods
Exercise

A) -1, 2, -3, 4, -5, 6

B) 1, 2, 4, 8, 16, 32

C) 2, -4, 8, -16, 32, -64

D) -1, 2, -4, 8, -16, 32

E) None of the above

3.38
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Find the first six numbers of the sequence defined by the following
recursive formula.
Contents
a0 = −1, an = −2an−1 Proving Methods
Exercise

A) -1, 2, -3, 4, -5, 6

B) 1, 2, 4, 8, 16, 32

C) 2, -4, 8, -16, 32, -64

D) -1, 2, -4, 8, -16, 32 correct answer!

E) None of the above

3.38
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Recognize the pattern of the following integer sequence then find

the next 4 numbers of the sequence.
Contents
1, 0, 2, 2, 0, 0, 4, 4, 4, 0, 0, 0, . . . Proving Methods
Exercise

A) Not exist

B) 8,8,8,8

C) 6,6,6,6

D) Either 8,8,8,8 or 0,8,8,8

E) None of the above.

3.39
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Recognize the pattern of the following integer sequence then find

the next 4 numbers of the sequence.
Contents
1, 0, 2, 2, 0, 0, 4, 4, 4, 0, 0, 0, . . . Proving Methods
Exercise

A) Not exist

B) 8,8,8,8

C) 6,6,6,6

D) Either 8,8,8,8 or 0,8,8,8 correct answer!

E) None of the above.

3.39
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Which of the following statement is correct?

Contents
A) A number is rational if and only if its square is a rational Proving Methods
number. Exercise
2
B) integer n is odd if and only if n + 2n is odd.

C) number is irrational if and only if its square is an irrational

number.

D) A number n is odd if and only if n(n + 1) is even.

E) None of the above.

3.40
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

Which of the following statement is correct?

Contents
A) A number is rational if and only if its square is a rational Proving Methods
number. Exercise
2
B) integer n is odd if and only if n + 2n is odd. correct answer!

C) number is irrational if and only if its square is an irrational

number.

D) A number n is odd if and only if n(n + 1) is even.

E) None of the above.

3.40
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

When the sun rises, two models X and Y start walk along the
seashore. X walk from A to B, and the other from B to A. At
12PM, the two meet the other, and continue walking with the
Contents
same velocities. The first person arrives at B at 4M, and the other Proving Methods
arrives at A at 9PM. Exercise
When did the sun rise?

A) 5:30 AM

B) 6:00 AM

C) 6:30 AM

D) 7:00 AM

E) None of the above

3.41
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

When the sun rises, two models X and Y start walk along the
seashore. X walk from A to B, and the other from B to A. At
12PM, the two meet the other, and continue walking with the
Contents
same velocities. The first person arrives at B at 4M, and the other Proving Methods
arrives at A at 9PM. Exercise
When did the sun rise?

A) 5:30 AM

B) 6:00 AM correct answer!

C) 6:30 AM

D) 7:00 AM

E) None of the above

3.41
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

The Fibonacci numbers form the sequence of 1, 2, 3, 5, 8, 13, 21,

34, ..., with the following definition: a1 = 1, a2 = 2, v Contents
an+2 = an+1 + an , ∀n ≥ 1. The greatest common divisor of a100 Proving Methods
and a99 is: Exercise

A) 1

B) 2

C) 218922995834555169026

D) None of the above

3.42
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

The Fibonacci numbers form the sequence of 1, 2, 3, 5, 8, 13, 21,

34, ..., with the following definition: a1 = 1, a2 = 2, v Contents
an+2 = an+1 + an , ∀n ≥ 1. The greatest common divisor of a100 Proving Methods
and a99 is: Exercise

A) 1 correct answer!

B) 2

C) 218922995834555169026

D) None of the above

3.42
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

In the Far Far Away kingdom, money is rarely used. People are
often trading with their goods or with coins of value 5g or 7g. Is
every good that has the price of 29g and above tradable using the
Contents
above coins?
Proving Methods
Choose the most correct answer for the above question.
Exercise

A) No

B) The question should be goods with the price above 25g

C) Should be goods with the price above 35g

D) Should change the question to goods with any price

E) Yes

F) None of the above

3.43
Exercise Proving methods

Nguyen An Khuong,
Tran Tuan Anh, Mai
Xuan Toan, Tran Hong
Tai

In the Far Far Away kingdom, money is rarely used. People are
often trading with their goods or with coins of value 5g or 7g. Is
every good that has the price of 29g and above tradable using the
Contents
above coins?
Proving Methods
Choose the most correct answer for the above question.
Exercise

A) No

B) The question should be goods with the price above 25g

C) Should be goods with the price above 35g

D) Should change the question to goods with any price

E) Yes correct answer!

F) None of the above

3.43