Scribd
Upload
1 views

4 ProblemSolving-Handouts

The document outlines two types of reasoning: deductive and inductive, with deductive reasoning moving from general to specific and inductive reasoning from specific to general. It also details Polya's 4-step problem-solving process and provides examples of mathematical problems, including the Fibonacci sequence and tiling an n-board. Additionally, it discusses patterns and geometric concepts related to chords and regions formed by points on a circle.

Uploaded by

koursua
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

4 ProblemSolving-Handouts

The document outlines two types of reasoning: deductive and inductive, with deductive reasoning moving from general to specific and inductive reasoning from specific to general. It also details Polya's 4-step problem-solving process and provides examples of mathematical problems, including the Fibonacci sequence and tiling an n-board. Additionally, it discusses patterns and geometric concepts related to chords and regions formed by points on a circle.

Uploaded by

koursua
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Two types of reasoning

• Deductive
Problem Solving – From general to specific
and • Inductive
Mathematical – From specific to general

Investigations

Polya’s 4-Step Process


Deductive Reasoning
• Understand the problem • All UP students are intelligent.
• Devise a plan • John is a UP student.
– Guess and test, find pattern, look for a • Therefore, John is intelligent.
formula, draw a graph/picture/diagram
• Carry out the plan
• Look back
– Check answer, find better solution,
– generalize solution?

ORIGINAL MATH
PROBLEM Translate VERSION Inductive Reasoning
• 2 is an even number
C
H
S
o
• 12 is an even number.
E
C
l
v
• 22 is an even number.
K e
• Therefore, all numbers ending with 2
SOLUTION are even numbers.
OF ORIGINAL SOLUTION
PROBLEM
Interpret
OF MATH
VERSION
Inductive Reasoning
• Math 1 is not difficult.
• Math 2 is not difficult.
• Therefore, all math courses are not NUMBER
difficult.
NOTE: The conclusion drawn when using inductive reasoning may
PATTERNS
not be true, but is an intelligent guess, or a hypothesis. It still has
to be proven.

Find the next


Write the numbers 1, 2, 3, 4, number:
5, 6 such that each side • 3, 9, 15, 21, 27, ?
totals 12. • 33
• 3, 15, 75, ?
• 375
• 2, 6, 22, 56, 114, ?
• 202

Place 1, 2, 3, 4, 5, 6 in each 2 6 22 56 114


circle such that each side of
the figure totals 12.
4 16 34 58
4
12 18 24
3 2

5 1 6
6 6
1, 1, 2, 3, 5, 8, ?
13, 21, 34, 55

THE FIBONACCI 1, 1, 2, 3, 5, 8, 13,…


SEQUENCE • Choose any term in the sequence and
square it. Then multiply the two
numbers beside the number you chose.
• F1=1, F2 = 1
Find the difference of the two
results.
Fn= Fn-1 + Fn-2. • Repeat the same steps for a different
term in the sequence.
• The difference is always 1 (or –1).
• 1, 1, 2, 3, 5, 8, 13,
21, 34, ……

This is the Fibonacci Problem:

How many pairs of 1, 1, 2, 3, 5, 8, 13,…


rabbits will be
produced in a year, • Add the first and third terms.
beginning with a • 1 + 2 =3
single pair, if every • Add the first, third, and fifth
month each pair
terms.
bears a new pair
which becomes • 1 + 2 + 5 = 8
(1180-1250) productive from the • Continue the process. Is there
second month on?
a pattern?
1, 1, 2, 3, 5, 8, 13,… 1
• Add the second and fourth
1 1
terms. 1 2 1
• Add the second, fourth, and 1 3 3 1
sixth terms.
• Repeat the process and find a 1 4 6 4 1
pattern. 1 5 10 10 5 1
PASCAL TRIANGLE

1, 1, 2, 3, 5, 8, 13,… 1
1 1
1 2 1
F1 + F3 + F5 +….+ F2n-1 =
F2n
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1

1, 1, 2, 3, 5, 8, 13,…

GEOMETRIC
F2 + F4 + F6 +….+ F2n PATTERNS
= F2n+1 - 1
Tiling an n-board How many ways can
we tile an n-board?

n-board

Let fn denote the number of ways


1xn to tile an n-board with 1 × 1 tiles
and 1 × 2 dominoes.

1x1 1x2
square domino

Consider a 1 x 6 board: Tiling an n-board


• f1 = 1

• f2 = 2

• f3 = 3
1x4 board

Circles and Chords


Mark a number of points on a
circle and join them by chords,
investigate and have fun!

Tiling an n-board

• f4 = 5

• f5 = ?

• f6 = ?

Tiling an n-board

• f1=1, f2 = 2, f3 = 3,…

• 1, 2, 3, 5, 8, 13, 21,……

Fn= Fn-1 + Fn-2.


For n points on the circle:

• What is the maximum number of


chords?
• What types of polygons are formed? n4 – 6 n3 + 23 n2 – 18n + 24
• What is the maximum number of 24
regions formed?

Number of Chords

No. of points No. of chords


Complete the ff table:
1 0 1(1-1)/2 = 0 1 3 6 10 15 21
2 1 2(2-1)/2 = 1 1 4 9 16 25
3 3 3(3 – 1)/2 = 3 1 5 12 22
4 6 4(4-1)/2 = 6 1 6 15
5 10 5(5 – 1)/2 = 1 7
10
1

Number of regions Figurate Numbers


No. of points No. of regions
1 1 20 Triangular 1 3 6 10 15 21 28 36
2 2 21 Square 1 4 9 16 25 36 49
3 4 22 Pentagonal 1 5 12 22 35 41
4 8 23 Hexagonal 1 6 15 28 45
5 16 24 Heptagonal 1 7 18 34
Octagonal 1 8 21
What is the maximum number of regions
formed if n = 6?

You might also like