Professional Documents
Culture Documents
Module 5 MMW Problem Solving
Module 5 MMW Problem Solving
Module 5
•Problem Solving with Patterns
Examples:
1. Fibonacci Sequence
• Jacques Binet was able to find the formula for the nth
Fibonacci number.
2. Pascal’s Triangle
3. Tower of Hanoi
Fibonacci Sequence
- Formula: F(n) = F(n-1) + F(n-2)
The sequence begins as follows:
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144….
- Jacques Binet was able to find the formula for the nth
Fibonacci number
Fibonacci Sequence
- F(n) = F(n-1) + F(n-2)
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ….
- F(7) = F(7-1) + F(7-2) 7 7
= 8 + 5 = 13
(a+b)0 = 1
(a+b)1 = 1a + 1b
2 2 2
(a+b) = 1a +2ab +1b
(a+b)3 = 1a3 + 3a2b +3ab2 +1b3
(a+b)4 = 1a4+ 4a3b+ 6a2b2+ 4ab3+1b4
and so on .
10
PASCAL’S TRIANGLE
1 Sum= 1 = 20
1 1 Sum= 2 = 21
1 2 1 Sum= 4 = 22
1 3 3 1 Sum= 8 = 23
Sum= 16 = 24
1 4 6 4 1
1 5 10 10 5 1 Sum= 32 = 25
There are many patterns that can be discovered in Pascal’s
triangle.
1. Find the sum of the numbers in each row, except row 0, of the
portion of Pascal’s triangle. What pattern do you observe
concerning these sums? Predict the sum of the numbers in row 9
of Pascal’s triangle.
From what we can see above, there are 10 ways for you to have exactly 3 girls from a
total of 1+5+10+10+5+1= 32 possible ways of having 5 children.
Conversely, there are as well 10 ways for you to have exactly 2 boys out of 5 children
which is still the same.
We can as well list it as follows and start counting from zero until the
desired value which is “3 girls” to get the number of ways.
Number of
girls
0 1 2 3 4 5
Row 5 of Pascal’s
1 5 10 10 5 1
Triangle
2.Devise a plan