Professional Documents
Culture Documents
Most occupations require good problem – solving skills. Every day, we solve simple problems that as we
frequently encounter them, give us skills and techniques in solving them.
In this learning guide, we will become better problem solver and believe that problem
solving can be an enjoyable experience.
The following lessons on the learning guide will help you understand better the concepts
of the Nature of Mathematics.
Lesson 1: Inductive and Deductive Reasoning
Lesson 2: Problem Solving with Patterns
The Monty Hall problem is a brain teaser, in the form of a probability puzzle, loosely based on
the American television game show Let's Make a Deal and named after its original host, Monty
Hall.
Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car;
behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens
another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your
advantage to switch your choice?
If you are the player, will you stay, or will you switch?
Well, how was it? Do you think you fared well? Compare your answers by watching the video on the
link provided. https://www.youtube.com/watch?v=4Lb-6rxZxx0
INDUCTIVE REASONING is the process of reaching a general conclusion by examining specific examples.
Example 1: Use inductive reasoning to predict the next number in each of the following Answer
lists. a. 15
a. 3, 6, 9, 12, … b. 15
b. 1, 3, 6, 10, …. c. 25
c. 5, 10, 15, 20, … d. 37
d. 2, 5, 10, 17, 26, …
20 + 3 – 3 9+ 5 - 5
20 9
The final answer is 4 times The final answer is 3 times
the original number the original number
Example 3:
Galileo used inductive reasoning to discover that the
time required for a pendulum to one swing, called period, depends on the length of the pendulum.
COUNTEREXAMPLES
A statement is a true statement provided that it is true for all cases.
If there is one case for which the statement is not true, called counterexample, then the statement is a false
statement.
LOGIC PUZZLES
Logic Puzzles can be solved by using deductive reasoning and a chart that enables us to display the given
information in a visual manner.
Sean is the banker, Maria is the editor, Sarah is the chef and Brian is
the dentist.
2. Four children are great friends. Use the clues below to find our which sport each child plays.
a. Brad plays a sport that begins with the same letter as his name.
b. Jenny has to kick the ball in the sport she plays.
c. Frank hit two homes -runs this season.
Jenny
Frank
Susan
Answer
2 1 4 3
1. 2 1 3 3.
1 3 2 4
3 2 1
3 4 1 2
1 3 2
4 2 3 1
TERMS OF A SEQUENCE
An ordered list of numbers such as 5, 14, 27, 44, 65… is called a sequence. The numbers in a sequence
that are separated by commas are the terms of the sequence.
𝑎𝑛 is used to designate the nth term in the sequence. That is, 𝑎1 , 𝑎2 , 𝑎3 𝑎4 ……𝑎𝑛
DIFFERENCE TABLE
Example 8:
Solution:
1. Construct a difference table
Example 9:
Assume the pattern shown by the square tiles in the following figures continues.
a. What is the nth term formula for the number of tiles in the nth figure of the sequence?
b. How many tiles are in the eight figures of the sequence?
c. Which figure will consist of exactly 320 tiles?
Solution:
a. Examine the figures for pattern. Note that the second figure has two tiles on each of the horizontal sections and
one tile between the horizontal sections. The third figure has 3 tiles on each horizontal section and two tiles
between the horizontal sections. The fourth figure has 4 tiles on
each horizontal section and three tiles between the horizontal
sections.
Thus, the number of tiles in the nth figure is given by two groups
of n pus a group of n less one.
That is, 𝑎𝑛 = 2𝑛 + ( 𝑛 − 1 ) or 𝑎𝑛 = 3𝑛 − 1
POLYGONAL NUMBERS
A. Triangular Numbers
The nth term formula for a triangular
number is:
𝑛 (𝑛 + 1)
𝑇𝑟𝑖𝑎𝑛𝑔𝑢𝑙𝑎𝑟 𝑛 =
2
B. Square Numbers
The nth- term formula for a square
number is:
𝑆𝑞𝑢𝑎𝑟𝑒𝑛 = 𝑛2
C. Pentagonal Numbers
𝑛(3𝑛 − 1)
𝑃𝑒𝑛𝑡𝑎𝑔𝑜𝑛𝑎𝑙𝑛 =
2
A Famous Puzzle: The Tower of Hanoi is a puzzle invented by Eduoard Lucas in 1883. The puzzle consists of
three pegs and a number of disks of distinct diameters stacked on one of the pegs such that the largest disk is
on the bottom, the next largest is placed on the largest disk and so on.
The object of the puzzle is to transfer the tower to one of the other pegs. The rules require that only one disk
may be moved at a time and that a larger disk may not be placed on smaller disk. All pegs may be used. Determine
the minimum number of moves required to transfer all of the disks to another peg for each of the following
situations.
1. You start with only one disk.
2. You start with two disks.
3. You can start with three disks.
No. of
1 2 3 4 5 6 7 n
coins
Least
no. of
moves