0% found this document useful (0 votes)
111 views13 pages

Problem-Solving: Section 1.1: Inductive and Deductive Reasoning

This document provides an overview of inductive and deductive reasoning. It discusses inductive reasoning as reaching a general conclusion by examining specific examples. It then provides three worked examples of inductive reasoning to form conjectures based on patterns in sets of data. The document also discusses the importance of checking conclusions for accuracy by looking for potential counterexamples, and provides two examples of finding counterexamples to disprove statements. Finally, it introduces the Monty Hall problem as a class activity involving probability.

Uploaded by

Trending
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
111 views13 pages

Problem-Solving: Section 1.1: Inductive and Deductive Reasoning

This document provides an overview of inductive and deductive reasoning. It discusses inductive reasoning as reaching a general conclusion by examining specific examples. It then provides three worked examples of inductive reasoning to form conjectures based on patterns in sets of data. The document also discusses the importance of checking conclusions for accuracy by looking for potential counterexamples, and provides two examples of finding counterexamples to disprove statements. Finally, it introduces the Monty Hall problem as a class activity involving probability.

Uploaded by

Trending
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Section 1.

1: Inductive and Deductive Reasoning

Problem-Solving

CSHU2833 - Logical Thinking – Faculty Of Information Technology, University of Central Punjab, Lahore
Course Textbook

Download book from:


[Link]
m/s/yqd4rrp8t46pgsl/M
athematical%20Thinkin
g%20and%20Quantitati
Inductive Reasoning

 The process of reaching a general


conclusion by examining specific
examples

 Example: My friend likes to read


essays by Arundhati Roy, so I’m sure
she’ll love her latest essays.
Inductive Reasoning – Worked
Example #1
 Use inductive reasoning to predict the most
probable next number in each of the
following lists.
a. 3,6,9,12,15,?
b. 1,3,6,10,15, 21,?

“Forming a Conjecture by inductive reasoning”


Inductive Reasoning – Worked
Example #2
 Pick a number. Multiply the number by 8, add 6 to the product, divide
the sum by 2, and subtract 3.
2 -->  8  
5 --> 20
7 --> 28
10--> 40 
15 --> 60 

 Complete the procedure for several different numbers.

 Use inductive reasoning to make a conjecture about the relationship


between:
 the size of the resulting number, and,
 the size of the original number.
Inductive Reasoning –
Worked Example #3

Examine the Data on Pendulum


Length and Pendulum Periods

Form a Conjecture by inductive


reasoning

If a pendulum has a length of 25 units, what is its period?


Class Activity -
Inductive Reasoning –
Worked Example #3

Examine the Data on Pendulum


Length and Pendulum Periods

Form a Conjecture by inductive


reasoning

If the length of a pendulum is quadrupled (multiplied by 4),


what happens to its period?
But is this proof?

 Important questions to ask ourselves about


any conclusion:

 Can we be certain about our conclusion?

 What if the conclusion is false in some situations?

 Can we prove our conclusion?


Checking conclusions

1. Place two dots


anywhere on the
boundary of the
circle
2. Connect them with a
line.
3. Count the number of
regions in the circle
4. Place a third dot and
connect it to the first
two dots.
5. Count the number of
regions.
6. Repeat steps 4 & 5.
Number of dots 1 2 3 4 5 6
Maximum number of regions 1 2 4 8 16 ?
Counterexamples

 A statement is true if and only if it is true in all


cases.
 And 
 111111111111 0 ==> 0

 If there is even one case where the statement is


not true, the statement is a false statement.

 The case where the statement is not true is called


a counterexample.
Counterexamples – Examples – 1

 Find a counterexample for each of the following


statements:

For all numbers x:


a. |x| > 0  0> 0  where x is not equal to 0 

b. x2 > x 0 > 0 , 1> 1

c. √(x2) = x 
5, 10, 15, 25, 35 
Counterexamples – Examples – 2

 Find a counterexample for each of the


following statements:

For all numbers x:


a. x / x = 1

b. (x+3)/3 = x+1

c. √(x2+16) = x+4
Class Activity -
The Monty Hall Problem
 To switch or not to switch?

 Simulator:
[Link]
simulation-online/

You might also like