Lecture 6

Constance 23/03/2023
INDUCTIVE AND DEDUCTIVE
REASONING
• Inductive reasoning (Observation) is a method of drawing conclusions by going from the
specific to the general. Inductive reasoning is also called inductive logic or bottom-up
reasoning.
• Inductive reasoning uses patterns, trends, observations and examples to make predictions.
• For Inductive reasoning the statement is logically true but may or may not be realistically
true.
• For example:
• Statement 1: Mango is a fruit
• Statement 2: The box is full of fruits
• Conclusion: The box is full of mangoes.
• This statement is logically true but realistically false because the box can contain other
fruits as well.
Constance 23/03/2023
 DEDUCTIVE REASONING
• Deductive reasoning is a logical approach where you progress from general ideas to
specific conclusions. Deductive reasoning is also called deductive logic or top-down
reasoning.
• For Deductive reasoning the statement is logically true and realistically true.
• Deductive reasoning uses existing theory or with proven or accepted information and
applies to draw a conclusion.
• For example:
• Statement 1: All humans have backbone
• Statement 2: Mary is a human
• Conclusion: Mary has a backbone
This statement is logically true and realistically true.

Constance 23/03/2023
 INDUCTIVE AND DEDUCTIVE REASONING CON’T
• Conclusions we arrive from inductive reasoning is called conjecture.
• A conjecture is a hypothesis that has not been proven or an unproven statement
that is based on observation.
• To prove conjectures, the principles of mathematical induction is used.
• DIFFERENCE BETWEEN INDUCTIVE AND DEDUCTIVE REASONING
INDUCTIVE REASONING DEDUCTIVE REASONING

Involves making a generalization from specific facts Uses available facts, information, or knowledge to
and observations deduce a valid conclusion
Moves from specific observation to a generalization Moves from generalization statement to a valid
conclusion
It uses bottom- up reasoning It uses top down reasoning
Conclusions are probabilistic Conclusions are certain
Inductive argument can be strong or weak, which Deductive argument can be valid or invalid, which
means conclusion maybe false even if premises are means if the premise are true, the conclusion must
true be true
Constance 23/03/2023
 MATHEMATICAL INDUCTION
Mathematical induction is a method for proving that a statement is true
for every natural number n , that is, that the infinitely many cases all hold.
STEPS IN SOLVING MATHEMATICAL INDUCTION
n: the number of terms (Natural number)
1. Base Step: Verify that P(n) is true. P is the propositional statement that
has a definite value.
2. Inductive Step: If we assume that P(n) is true for n=k then P(n) is true
for n= (k+1).
3. Conclude, by the Principles of Mathematical Induction (PMI) that P(n) is
true for all natural numbers n.
Constance 23/03/2023
 MATHEMATICAL INDUCTION
EXAMPLE 1: 3+7+11+….(4n-1)= n(2n+1)
• n =1
• 3= 1(2(1)+1)
• 3= 3 true
• n =2
• (3+7) = 2(2(2)+1)
• 10= 10 true
• n =3
• 3 +7+11 = 3(2(3)+1)
• 21= 21 true
• Assuming that n = k is true:
• 3+7+11+….(4k-1)= k(2k+1)
• Prove n= k+1 is also true:
• 3+7+11+….+ (4k-1) + (4(k +1)-1)= k+1(2(k+1)+1): RHS= LHS
• Replace this 3+7+11+…. + (4k-1) to k(2k+1)
• k(2k+1) + (4(k +1)-1)= k+1(2(k+1)+1)
• 2 + k + 4k+3 = 2 +5k +3
• 2 + 5k+3 = 2 +5k +3
• RHS= LHS : n=k+1 is true
Constance 23/03/2023
• Hence, by the Principles of Mathematical Induction (PMI), P(n) is true for all natural numbers n.
 MATHEMATICAL INDUCTION
• Example 2:
• Prove that
• n=1

• 1=1
• n = 2, is true

• 9 = 9, is true
• Assuming that n= k is true,

• Proving n= k+1 is also true:

• : RHS=LHS
• R by

• =
• Multiply both side by 4
• 4x = 4x
• + =
• ( + 4(k+1) =
• = Constance 23/03/2023
• Hence, by the Principles of Mathematical Induction (PMI), P(n) is true for all natural numbers n.
STEPS IN SOLVING INDUCTION
DIVISIBILITY PROBLEMS
Step 1. n =1
Step 2. Assume n=k
Step 3. Replace n=k+1

Constance 23/03/2023
HOW TO SOLVE INDUCTION DIVISIBILITY PROBLEMS
• Prove + 4 is divisible by 5 for all positive integers.
• n= 1
• +4
• = 10 which is divisible by 5
• n =k
• + 4 is divisible by 5
• + 4 =5m: m be an integer
• = 5m-4
• n =k+1
• +4
• (6) +4
• 6(5m-4)+4
• 30m -24 +4
• 30m-20
• 5(6m-4)
• Let 6m-4 =L
• 5L
• + 4 = 5L
• Hence + 4 is divisible by 5 for all positive integers is true
Constance 23/03/2023
EXERCISE
1. Prove using mathematical induction to show that the ff. expressions
are true.
a. 1+ 2+ + … = -1
b. 1+3+5+…+(2n-1) =
c. 1+2+3+ …+n =
d. 2+4+6+… +2n= n(n+1)
2. Prove that is divisible by 5 for all positive integers.
3. Prove that n(n+2) is divisible by 4 for all positive even integers.

Constance 23/03/2023