Module 3 PROBLEM SOLVING AND REASONING
Module 3 PROBLEM SOLVING AND REASONING
Problem solving involves reasoning and it does not mean you need
to produce immediate solutions. It entails appropriate use of
knowledge, facts, and data to effectively propose a solution. The ability
to create a well-thought-out solution within a reasonable time frame,
however, is a skill that can be well developed in the study of
mathematics.
Objectives
This module discusses the fundamental principles of solving
problems like the inductive and deductive reasoning, along with
some specific processes that can be applied to certain types of
problems.
It aims to develop students’ skills in pattern recognition to find the
solution and to answer various types of problems that pose
intellectual and recreational challenge.
It emphasizes the use of the existing patterns that abound in nature
to formulate such solutions.
Section 3.1 Inductive and Deductive Reasoning
Deductive Inductive
Specific
Cases
Deductive Approach Inductive Approach
Theory Theory
Hypothesis Hypothesis
Observation Pattern
Confirmation Observation
Examples
• Deductive
Approach
The sum of two odd integers is an even number.
and are odd numbers.
So, is even.
• Inductive Approach
3 and 5 are odd and is even
7 and 11 are odd and 7 + 11 = 18 is even
Therefore, the sum of two odd numbers is even.
Example: Deductive Reasoning
Premise 1: In a right triangle, the two acute angles are complementary.
Try verifying this: What is the final result of the operations if your age is
12 years? 35 years? Or any arbitrary age, say years?
Historical Example
One classic example of inductive inference is Galileo’s characterization
of the pendulums that led to the development of pendulum clocks.
Briefly put, he showed that the time it takes for a pendulum to take
one full swing (called period) is dependent on the length of the
pendulum. In particular, the period is the square root of the length. The
establishment of this property was not solely inductive. It took a while
for the deductive approach to be applied before the conclusion was
accepted as an absolute truth.
Remarks
• Inferences made by inductive process do not render absolute truth
(only conjecture).
• Conjectures can be proven as valid (or true) by deductive process.
• Conjectures can be proven as false by contradiction.
Example
Observe that: 2 + 4 = 6 and (2)(4) = 8
6 + 8 = 14 and (6)(8) = 48
12 + 10 = 22 and (12)(10) = 120
Conjecture: If the sum of two numbers is even, then their product is
also even.
Note: While this can be easily solved by algebraic method (that is,
introduce variables like and ), reasoning should be given more
emphasis at this stage.
Polya’s Way
• Understand the Problem Distribute 12 bills into two portions.
• Devise a Plan Perform trial and error. There are only 11 ways of
splitting 12 into two portions: 11 + 1, 10 + 2, 9 + 3, and so on. If
there are 11 P20 bills, then there must be one P50 bills, in which
case the total amount is 11(20) + 1(50) = 270 pesos. Reversing the
amounts, you have 11(50) + 1(20) = 570 pesos. Determine which
distribution of bills yields the amount P390.
Polya’s Way
• Carry out the plan
False True,False
Start
True False,True
False
False False,False
Example 1
For a 3-item test, we have the following combinations:
Can you figure out the outcomes if there are 4 items in the test?
Example 1
Summarizing, we can observe the first few results:
Can you figure out any pattern in the number of ways of answering the
test?
Example 1
It must be evident that the number of ways is always a power of 2:
Example 1
So, it appears that for n questions in the test, there are exactly 2n
ways of answering them. Specifically, if there are 10 questions, then
there must be 210 = 1024 ways.
Example 2
• In a certain gathering, participants greet each other through
handshakes. Of course, a person cannot shake his own hands and each
person can only shake hands with another person once. How many
handshakes occur in a party of people?
Example 2: Solution
We start observing initial cases. For only two individuals, say P1 and P2,
there is only one handshake that takes place since P1 to P2 is the same
as P2 to P1. For three individuals (P1, P2, P3), the distinct handshakes
are: P1 to P2, P1 to P3, and P2 to P3 (for a total of three handshakes).
Example 2: Solution
For four individuals (P1, P2, P3, P4), you have the following distinct
handshakes: P1 to P2
P1 to P3
P1 to P4
P2 to P3
P2 to P4
P3 to P4
(for a total of six handshakes).
Example 2: Solution
Summarizing,
Example 2: Solution
There seems to be a pattern on the number of handshakes.
Example 2: Solution
By brute force, we verify if there really are 10 handshakes among 5
people (P1, P2, P3, P4, P5):
(1) P1 to P2 (2) P1 to P3
(3) P1 to P4 (4) P1 to P5
(5) P2 to P3 (6) P2 to P4
(7) P2 to P5 (8) P3 to P4
(9) P3 to P5 (10) P4 to P5
Note: A tree diagram may serve a better visualization of the
handshakings.
Example 2: Solution
•So, as it appears, the number of handshakes is just incremented
successively by the natural numbers. This is evident because an
additional person must have a handshake with the original individuals.
We summarize this in the following table of values:
Example 2: Solution
•Conjecture:
The total number of handshakes is
This follows from the fact that the nth person will have to shake hand
with the other n-1 people. The division by 2 serves to eliminate double
counting (e.g. P1 to P2 is the same as P2 to P1).
Example 2: Solution
•Algebraically,
we can use the partial sums to prove our conjecture: