Professional Documents
Culture Documents
IN THE
MODERN WORLD
CHAPTER 3:
PROBLEM SOLVING AND
REASONING
3.1 Inductive Reasoning
3.2 Deductive Reasoning
3.3 Problem Solving with Patterns
3.4 Polya’s Problem-solving Strategy
LOGICAL REASONING
Logical reasoning is the process of using a rational, systematic series of
steps based on sound mathematical procedures and given statements to
arrive at a conclusion.
INFERENCES
An inference is a process of drawing conclusions based on the evidence. These are
connections between a given sentence (the “premise”) and some other sentence
(the “conclusion”).
Example:
• If there is someone at the door, the dog will bark. (Assuming this sentence holds
true, there are some other sentences that must also be true.)
• If the dog didn’t bark, there is no one at the door. (Just because the dog
barked doesn’t mean there’s someone at the door.)
There are also a few sentences that are probably true, such as:
• The dog can sense (hear or smell) when someone is at the door.
• The dog belongs to the people who live in the house where the door is located.
INFERENCES
Based on this premise… …you can infer:
Donna X2 X3 / X3
Sarah / X1 X1 X1
Nikkie X2 / X2 X2
Xhanelle X2 X3 X3 /
DEDUCTIVE REASONING
Example:
If x = 4
And if y = 1
Then 2x + y = 9
Example:
If entropy (disorder) in a system will increase unless energy is expended,
And if my living room is a system,
Then disorder will increase in my living room unless I clean it.
Example:
There is no such thing as drought in the West.
California is in the West.
California need never make plans to deal with a drought.
ABDUCTIVE REASONING
is a form of logical inference which starts with an observation or set of
observations then seeks to find the simplest and most likely explanation.
ABDUCTIVE REASONING
Example:
The doctor hears her patient’s symptoms, including the
regular shortness of breath on cold days and when exercising
and abduces that the best explanation of these symptoms is
that her patient is an asthma sufferer.
3.3 PROBLEM SOLVING
WITH PATTERNS
FIBONACCI NUMBERS USING
BINET’S FORMULA
Binet’s formula is an explicit formula used to find the nth term
of the Fibonacci sequence. It is so named because it was
derived by mathematician Jacques Philippe Marie Binet,
though it was already known by Abraham de Moivre.
𝑛 𝑛
1 1+ 5 1− 5
𝐹𝑛 = −
5 2 2
BINET’S FORMULA EXAMPLE
• Find the 9th Fibonacci Number.
Solution:
Since n = 9, we substitute the value to the formula:
9 9
1 1+ 5 1− 5
𝐹9 = −
5 2 2
F9 = 34
PASCAL’S TRIANGLE
• Is a triangular array of the binomial coefficients.