Proving Divisibility Statements and
Inequalities Using Mathematical
Induction
In a domino line, what
will happen if you
push the first domino?
How about if you push
one from somewhere
in the middle?
2
If the first domino falls,
all other dominos will
fall. Likewise, if you
push a domino
somewhere in the
middle, the rest after it
will also fall.
3
The given situation is
one of the best
examples that model
the principle of
mathematical
induction.
4
If a statement is true for (or any other base case), and
assuming that it is true for any natural number implies it is
true for , then the statement is true for all natural numbers
(or starting from the base case).
5
How is the principle of
mathematical induction used in
proving divisibility statements
and inequalities?
6
Principle of Mathematical Induction (Recall)
Let be a statement for every integer from a subset of the
set of integers. is true for all integers in the set if the
following conditions are satisfied:
1. is true.
2. If is true, then is true for any integer
.
7
Proving Divisibility Statements
Property of Divisibility
If a number is divisible by another number , then for
some integer .
8
Proving Divisibility Statements
Property of Divisibility
If a number is divisible by another number , then for
some integer .
Examples:
1. 12 is divisible by 3 since .
2. 35 is divisible by 7 since .
9
If is divisible by 2, how can you
express the value of ?
10
Prove by mathematical induction that is divisible by
3 for any natural number .
11
Prove by mathematical induction that is divisible by
3 for any natural number .
By mathematical induction, is divisible by 3 for any
natural number .
12
Prove by mathematical induction that
is divisible by 4 for any natural number .
13
Prove by mathematical induction that is divisible by
8 for any natural number .
14
Prove by mathematical induction that is divisible by
8 for any natural number .
By mathematical induction, is divisible by 8 for any
natural number .
15
Prove by mathematical induction that
is divisible by 3 for any natural number .
16
Prove by mathematical induction that is divisible by
7 for any natural number .
17
Prove by mathematical induction that is divisible by
7 for any natural number .
By mathematical induction, is divisible by 7 for any
natural number .
18
Prove by mathematical induction that is
divisible by 5 for any natural number .
19
In proving divisibility statements
involving expressions of the form
, we can use the identity
.
20
In Example 3, we have
for some integer . Hence, it could be
observed that is divisible by 7.
21
Properties in Proving Inequalities
Transitive Property of Inequality
Let , , and be real numbers. If and , then
. If and , then .
22
Properties in Proving Inequalities
Transitive Property of Inequality
Let , , and be real numbers. If and , then
. If and , then .
Examples:
1. Since and , .
2. Since and , .
23
Properties in Proving Inequalities
Addition Property of Inequality
Let , , and be real numbers. If , then
. If , then .
24
Properties in Proving Inequalities
Addition Property of Inequality
Let , , and be real numbers. If , then
. If , then .
Examples:
1. Since , .
2. Since , .
25
How can we use the transitive
and addition properties in
proving inequalities using
mathematical induction?
26
Prove by mathematical induction that for any
integer .
27
Prove by mathematical induction that for any
integer .
By mathematical induction, for any integer
.
28
Prove by mathematical induction that
for any integer .
29
Prove by mathematical induction that for any
integer .
30
Prove by mathematical induction that for any
integer .
By mathematical induction, for any integer .
31
Prove by mathematical induction that
for any integer .
32
Prove by mathematical induction that for any
integer .
33
Prove by mathematical induction that for any
integer .
By mathematical induction, for any integer .
34
Prove by mathematical induction that
for any integer .
35
Write TRUE if the statement is correct. Otherwise,
write FALSE.
1. If a number is divisible by 10, then for some integer .
2. If is divisible by , then for any integer ,
.
3. If and , then .
4. If , then .
5. If and , then .
36
Prove the following divisibility statements for any
natural number using mathematical induction.
1. is divisible by 8.
2. is divisible by 6.
3. is divisible by 2.
4. is divisible by 3.
5. is divisible by 7.
37
Prove the following inequalities using mathematical
induction.
1. for .
2. for .
3. for .
4. for .
5. for .
38
● In proving divisibility statements using
mathematical induction, we usually apply the
divisibility property which states that if a
number is divisible by another number , then
for some integer .
39
● In proving inequalities using mathematical
induction, we usually apply the transitive and
addition properties of inequality.
o If and , then . If and
, then .
o If , then . If , then
.
40
Prove that is divisible by 3 for any
natural number .
41
