Chapter 3 (Problem Solving)
Chapter 3 (Problem Solving)
Topic Outline
Christian Goldbach
(1690-1764)
Russian Mathematician
Counterexample if a statement is a
true statement provided that it is true
in all cases and it only takes one
example to prove the conjecture is false.
Deductive reasoning is
drawing general to specific
examples or simply from
general case to specific case.
Deductive
Reasoning
General Special
Principle Case
Inductive
Reasoning
If one has a conjecture, the only way that it can safely be sure
that it is true, is by presenting a valid mathematical proof.
Mathematical
Original Problem Translate Version of the
Problem
Solve
Check
Solution to the
Interpret Answer to
mathematical
Original Problem
version
Be systematic.
Work backwards.
Consider special cases.
Eliminate possibilities.
Perform an experiment.
Draw a picture/diagram.
Ensure that all the conditions related to the problem are met.
Solution:
Step 1: Understand the Problem.
2(x + 3) = 3x + 4
2x + 6 = 3x + 4
3x – 2x = 6 – 4
x=2
Step 4: Look Back.
Solution:
Step 1: Understand the Problem.
The problem is confusing and must be carefully
analyzed.
3rd : Riana gave Sofia and Achaiah as much money as each has.
2nd : Achaiah gave Sofia and Riana as much money as each has.
1st : Sofia gave Achaiah and Riana as much money as each has.
Initially Sofia had ₧208, Achaiah had ₧112, and Riana had ₧64.
Thus, Sofia, Achaiah, and Riana’s initial money are ₧208, ₧112,
and ₧64, respectively.
Copyright 2018: Mathematics in the Modern World by Winston S. Sirug, Ph.D.
Problem Solving Strategies
Example 4: If the length of the top of a rectangle is 15 inches
more than its width and the area is 1,350 square
inches. Find the dimension of the table.
Solution:
Step 1: Understand the Problem.
Look for the length and width of
the table.
Area = lw
1,350 = lw = (15 + w)w
Terms of the sequence are a1, a2, a3, a4, …, an–1, an, …
a. 1, 2, 3, 4, 5, 6, 7
b. 2, 4, 6, 8, 10, 12, 14 Finite sequences
c. 1, 3, 5, 7, 9, 11, 13, 15
d. 3, 6, 9, 12, 15, …
e. 1, 1, 2, 3, 5, 8, 13, … Infinite sequences
f. f. 1, 4, 9, 16, 25, 36, …
A general sequence a1, a2, a3, a4, …, an–1, an, … having the first
term a1, the second term is a2, the third term is a3, and the nth
term, also called the general term of the sequence, is an.
Solution:
an = 3n + 1
a1 = 3(1) + 1 = 3 + 1 = 4 Replace n by 1.
a2 = 3(2) + 1 = 6 + 1 = 7 Replace n by 2.
a3 = 3(3) + 1 = 9 + 1 = 10 Replace n by 3.
Thus, the first three terms of the sequence are 4, 7, and 10.
If the first differences are not the same, compute the successive
differences of the first differences .
Solution:
a. 3, 7, 11, 15, 19, …
Sequence 3 7 11 15 19 23
First differences 4 4 4 4 4
Solution:
b. 2, 4, 9, 17, 28, …
Sequence 2 4 9 17 28 42
+
First differences 2 5 8 11 14
+
Second differences 3 3 3 3
Solution:
c. 6, 9, 14, 26, 50, 91, …
Sequence 6 9 14 26 50 91 154
+
First differences 3 5 12 24 41 63
+
Second differences 2 7 12 17 22
+
Third differences 5 5 5 5
a. Triangular Number
1 3 6 10 15
Generalized as Tn = 1 + 2 + 3 + … + (n – 1) + n = ½(n2 + n)
If n = 6
= ½(62 + 6)
= ½ (36 +6)
= ½ (42)
= 21
If n = 10
= ½ (102 + 10)
= ½ (100 + 10)
= ½ (110)
= 55
Mathematical Problem involving Patterns
b. Square Number
1 4 9 16 25
Generalized as Sn = an-1 + 2n – 1
If n = 6
= Sn-1 + 2n – 1
= 25 + 2(6)-1
=25+11
=36
Mathematical Problem involving Patterns
c. Pentagonal Number
1 5 12 22 35
Generalized as ? assignment
Difference table
Heptagon Octagon
Solution:
When n = 0 and continuing the case to n = 6.
Summary Table
No. of Points 1 2 3 4 5 6
No. of Chords 0 1 3 6 10 15
No. of Regions 1 2 4 8 14 31
1. pentagon
2. hexagon
3. And so on
Recreational Problems using Mathematics
Lo Shu
Copyright 2018: Mathematics in the Modern World by Winston S. Sirug, Ph.D.
Recreational Problems using Mathematics
Durer’s
Melancholia
To maximize the number of pieces in the next cut, then nth cut
must cut each of the n – 1 previous one.
The new cut meets one of the n – 1 previous one, a pizza piece
is cut in two.
A piece cut in two when the new cut finishes on the opposite
side of the pizza.
f(1) = 2
f(2) = 4 = 2 + f(1)
f(3) = 7 = 3 + f(2)
f(4) = 11 = 4 + f(3)
:
f(n) = n + f(n – 1)
f(n) = n + (n – 1) + (n – 2) + … + 2 + f(1)
= f(1) +
= 2 + ½(n + 2)(n – 1)
= 2 + ½(n2 + n – 2)
= ½(n2 + n + 2)
Evaluating for
n = 0, 1, 2, 3, 4, 5, 6, 7, … gives 1, 2, 4, 7, 11, 16, 22, 29, …
26
26
Solution:
The numbers SEND, MORE, and MONEY;
S + 1 = O.
Recall: S + 1 = 10 + O
(Note S 1 and O 1, since M = 1).
E + 0 = N.
N = E + 1. (Note: E 9 and N 0).
N + R = E.
Note: N = E + 1, thus 1 + N + R = 9 + N or R = 8
The sum is
https://www.youtube.com/watch?v=z7vo7Z-Ejn0
DEDUCTIVE REASONING
The definition of a good
mathematical problem is the
mathematics it generates rather than
the problem itself.
– Andrew
Wiles
Copyright 2018:
Mathematics in the Modern World by Winston S. Sirug, Ph.D.