LESSON 3 Polya (NGEC 4) PDF
LESSON 3 Polya (NGEC 4) PDF
LESSON 3 Polya (NGEC 4) PDF
One of the recent mathematicians who outlined a strategy for solving problems
from virtually any discipline is George Polya (1887-1985). In his book, How To Solve It,
he writes,
“A great discovery solves a great problem but there is a grain of discovery in the solution of any
problem. Your problem may be modest; but if it challenges your curiosity and brings into play your
initiative faculties, and if you solve it by your own means, you may experience the tension and enjoy
the triumph of discovery.”
Because of his ideas, he is considered the father of problem-solving among mathematicians. The
following four-step strategy is named after him:
Devise a Plan
In this step, you must think of strategies to solve the problem. Some of your strategies include
organizing the given information using a list, table or chart; drawing a diagram,; working out the problems
backwards; looking for a pattern; trying to solve a similar but simpler problem; writing an equation; or
simply guessing at a possible solution and then later checking if the result is valid.
Example 10: Apply Polya’s Strategy (Solve a similar but simpler problem)
Consider the map as shown in the figure below. Allison wishes to walk along the streets from point
A to point B. how many direct routes can Allison take?
Solution:
Understand the Problem We would not be able to answer the question if Allison retraced her path or
traveled away from point B. Thus, we assume that on a direct route, she always travels along a street in a
direction that gets her closer to point B.
Devise a Plan The map in the preceding figure has many details. Thus we make a diagram that allows us
to concentrate on the essential information. See the figure below.
B
A simple diagram of the street map in the figure above.
Because there are many routes, we consider the similar but simpler diagrams shown below. The
number of each street intersection represents the number of routes from point A to that particular
intersection.
Look for patterns. It appears that the number of routes to an intersection is the sum of the number of
routes to the adjacent intersection to its left and the number of routes to the intersection directly above.
For instance, the number of routes to the intersection labeled 6 is the sum of the number of routes to the
intersection to its left, which is 3, and the number of routes to the intersection directly above, which is
also 3.
Carry Out the Plan Using the pattern discovered above, we see from the figure below that the number
of routes from point A to point B is 35.
A
1 1 1 1
1 3
2 4 5
1 6 10
3 15
B
1 4 10 20 35
Review the Solution Ask yourself whether a result of 35 seems reasonable. If you were required to draw
each route, could you devise a scheme that would enable you to draw each route without missing a route
or duplicating a route?
Solution:
Understand the Problem. There are many different ways Magnolia Hotshots may have won three straight
wins and three losses (WWWLLL), or maybe lost in the first three games and won in the last three games
(LLLWWW). Likewise, there are other several orders.
Devise a Plan. One can organize a list of all the possibilities making sure that no entry will be duplicated.
Carry Out the Plan. Three Ws must be present in every entry without duplication. The strategy is to start
the list with three consecutive wins. Next in the list are all the entries starting with two consecutive wins,
then next in the list are all entries starting with a single win. Following this pattern, consider starting with
three consecutive losses and so on. Here are the different orders.
1. WWWLLL 7. WLWWLL 13. LWWWLL
2. WWLWLL 8. WLWLWL 14. LWWLLW
3. WWLLWL 9. LLLWWW 15. LWLLWW
4. WWLLLW 10. LLWLWW 16. LWLWLW
5. WLLLWW 11. LLWWLW
6. WLLWWL 12. LLWWWL
Review the Solution. The list is organized and has no duplicates, so there are sixteen (16) different
orders in which a basketball team can win exactly three out of six games.
Solution:
Understand the problem. Obviously, you need to find the height of the person in this problem.
Devise a Plan. Let x represent the unknown height of the person. Write an equation satisfying da Vinci’s
measurements.
Devise a Plan. Use 𝑥 and 𝑦 to represent the two types of tourists. Define these variables. Let 𝑥 be the
number of tourists bound for Macau alone and 𝑦 be the number of tourists bound for Macau but who
made a side trip to Hong Kong. Hence, we have the following algebraic equations:
₱15,000𝑥 = amount collected from the tourists bound for Macau alone
₱20,000𝑦 = amount collected from the tourists bound for Macau but who made a side trip to Hong Kong
Carry Out the Plan. Write the equations and solve using the elimination method to the system of
equations.
Equations:
𝑥 + 𝑦 = 10 -------------------------- equation (1)
15,000𝑥 + 20,000𝑦 = 170,000 ------------ equation (2)
To find the number of tourists bound for Macau but who made side trip to HK, we solve for 𝑦.
Review the Solution. Since there are total of 10 tourists, six of them only stayed in Macau while four
made a side trip to Hong Kong. Now, 15,000(6) + 20,000(4) = 170,000. This satisfies the condition that
the total amount collected for the whole trip is ₱170,000.