Professional Documents
Culture Documents
Chapter 4
Chapter 4
In this movie, the bomb did not explode, When you examine a list of numbers and
thanks to McClane’s quick reasoning ability and predict the next number in the list according
mathematical strategy. some pattern you have observed, you are using
A good problem solver is the one who can inductive reasoning.
find a resolution of which the path to the answer
is not immediately known. McClane epitomizes a Example 1: Use inductive reasoning to predict the
good problem solver by using a strategy which next number in each of the following
cannot be learned through school drills. lists.
In the real world, decision-making and a. 5, 10, 15, 20, 25, ?
problem-solving are two key areas that one b. 1, 4, 9, 16, 25, ?
should be good at in order to survive. In this
chapter, you will learn to organize your own
methods and approaches to solve mathematical
problems.
Solution: We started with 3 and the procedure
a. Each successive number is 5 units larger than produces 15. Starting with 2 as our original
the preceding number. Thus, it number and the procedure produces 10. Starting
can be predicted that the next number in the list with 5 as our original number and the
is 5 units larger than 25, which procedure produces 25. Starting with 10 as our
is 30. original number and the procedure
produces 50. In each of these cases the procedure
b. Observe that all numbers are perfect squares. produces a number that is five times
1 = 12 , 4 = 22 , 9 = 32 , 16 = 42 , 25 = 52 . Thus, it larger than the original number. Thus, it is
can be predicted that the next number is 36, conjectured that the given procedure
since 36 = 62 . produces a number that is five times larger than
the original number.
Inductive reasoning is not just used only to
predict number in a list. In Example 2, we use Example 3: Use the data in the table and by
inductive reasoning to make a conjecture about inductive reasoning, answer the following
an arithmetic procedure. questions below.
Solution: Construct a difference table as shown The Fibonacci sequence then is the ordered
below. list of numbers 1, 1, 2, 3, 5, 8, …,
Fn, …where the three dots indicate that the
sequence continues beyond 8 and Fn.
How do we determine Fn, the nth term? Observe
that,
F2 = F1 It is easy to find
F3 = F2 + F1 the nth Fibonacci
F4 = F3 + F2 number Fn if the two
F5 = F4 + F3 previous numbers,
F6 = F5 + F4 Fn-1 and Fn-2 are
known. Suppose we
From these patterns, we conjecture that Fn = Fn want to find F20.
– 1 + Fn – 2, for n ≥ 3. Fibonacci discovered that a Using the definition,
Fibonacci number can be found by adding its it is tedious and time
previous two Fibonacci numbers. consuming to
compute F19 and F18
to determine F20.
Fortunately, Jacques
Binet in 1543 was
Example 2: Finding a Fibonacci Number. able to find a formula
Use the definition of Fibonacci numbers to find for the nth Fibonacci
the eight and tenth Fibonacci number:
numbers.
Solution:
The eight Fibonacci number is the sum of the
two previous Fibonacci numbers. Example 3: Use Binet’s formula and a calculator to
Thus, find the 20th and 50th Fibonacci
F8 = F7 + F6 number.
F8 = (F6 + F5) + F6 Solution:
F8 = (8 + 5) + 8
F8 = 13 + 8
F8 = 21
The tenth Fibonacci number is the sum of the Pascal’s Triangle
two previous Fibonacci numbers in an ordered Another famous mathematician who loves
sequence. Thus, patterns is Blaise Pascal (1623 – 1662). For
hundreds of years, many mathematicians were
F10 = F9 + F8 intrigued with the Pascal’s triangle. The figure
= (F8 + F7) + F8 below illustrates the first seven rows of the
= (21 + 13) + 21 Pascal’s triangle. As you can see, each row starts
= 34 + 21 and ends with the number 1. Any other number x
= 55 is the sum of the two numbers in the previous
row closest to that number x. For instance, the
number 15 in row 6 is the sum of numbers 5 and
10 closest to it in the previous row,
In algebra, expanding (𝑥 + 𝑦) 3 = 𝑥 3 + 3𝑥 2𝑦 Website Application
+ 3𝑥𝑦2 + 𝑦 3 is just a simple special product Another equally famous problem involving
process. But expanding (𝑥 + 𝑦) 6 can be tedious. patterns is the Tower of Hanoi, invented by
Amazingly, note that the numerical coefficients Edouard Lucas in 1883. The Tower of Hanoi is a
of the expansion of (𝑥 + 𝑦) 3 = 𝑥 3 + 3𝑥 2𝑦 + 3𝑥𝑦2 puzzle consisting of three pegs and a number of
+ 𝑦 3 are the entries of row 3 of the Pascal’s disks of distinct diameters piled as shown in the
triangle, i.e., 1, 3, 3, 1. Moreover, take note that figure below.
the exponents of x in the expansion starts with 3
and decreasing in the succeeding terms while the
exponents of y starts with 0 and increasing in the
remaining terms. Now, we expand (𝑥 + 𝑦) 6 using
the entries in row 6 (1, 6, 15, 20, 15, 6, 1) of the
Pascal’s triangle. The result is given below.
(𝑥 + 𝑦) 6 = 𝑥 6 + 6𝑥 5𝑦 + 15𝑥 4𝑦 2 + 20𝑥 3𝑦 3 + The puzzle requires that all the disks be moved
15𝑥 2𝑦 4 + 6𝑥𝑦5 + 𝑦 6 from the first peg to the third peg such that the
largest disk is on the bottom, the next largest disk
Can you try expanding (𝑥 − 𝑦) 7 ? is placed on top of the largest disk and so on and
that only one disk be moved at a time. All pegs
Suppose you add the horizontal entries in may be used.
the rows of the Pascal’s triangle except row 0.
What pattern do you observe in these sums? Can
you predict the sum of the sum of the entries in
row 10?
Row Sum
1 2
2 4
3 8
4 16 4.3 Polya’s Problem-Solving Strategy
5 32
6 64
10 ?
Another amazing discovery in Pascal’s
triangle is that when you get the sum of the
numbers using lines as shown in the next figure,
the Fibonacci sequence appears. The first seven
Fibonacci numbers 1, 1, 2, 3, 5, 8, 13 show up.
Solution: