193396 Triela Miguel

193447 Rosmina Montellano

194823 Andre Tan

PROBLEM SET

Use Polya's four-step approach and the problem-solving procedures we

discussed in class to solve each of the following. Write out how you applied
each of the four steps in the process.

1. ​Find the last digit of the sum 2018​150 ​+ 2019​151​.

Step 1: Understand the problem

● This kind of problem works with very large numbers

that is impossible to be solved by a calculator.
● In order for us to solve this problem, we should find
a pattern.
● Since the problem requires only the last digits, we
will be working with numbers 8 and 9, the units digit
of 2018 and 2019.

​Step 2: Devise a plan

● Make a pattern to find the units(last) digit of

2018150
● We figured out the pattern. The numbers 8,4,2, and
6, which are the units digit of the squares of 8,
creates a repeating sequence as you further square
the number 8.

● Make a pattern to find the units(last) digit of

2019151
 ● The number 9 and 1, which are the units digit of the
squares of 8, creates a repeating sequence as you
further square the number 9.

Step 3: Carry out the plan:

● The exponent of 2018 is 150. In order for us to get

the last digit of 2018150 we must divide 150 by 4
since there are 4 repeating numbers in the
sequence.

150 = 75 = 37 42
4 2

● The remainder is equal to 2, therefore 4 is the last

units digit of 2018150

● The exponent of 2019 is 151. In order for us to get

the last digit of 2019151 , we must figure out if it is an
odd/even number. In the table, odd exponents
correspond to the number 9 and even exponents
correspond to the number.
● 151 is an odd number, therefore, the last units digit
of 2019151 is 9.
● Answering the main question, we should add the
last(units) digit that we have obtained for both
numbers.

4 + 9 = 13

● Therefore, the sum of the last digit of 2018150 and

2019151 is equal to 13.
Step 4: Review the solution

● We have reached a solution through making

patterns and identifying the sequence. What comes
after this is the finding of what’s next in the
sequence that corresponds to each number(
2018150 and 2019151 ).

2. ​An egg vendor was delivering a shipment of eggs had an accident and all the eggs
he had were broken. He could not remember how many eggs he had to deliver.
However, he remembered that
•when he tried to pack them in packages of 2, he had one left over;
•when he tried to pack them in packages of 3, he had one left over;
•when he tried to pack them in packages of 4, he had one left over;
•when he tried to pack them in packages of 5, he had one left over;
•when he tried to pack them in packages of 6, he had one left over. Nonetheless,
when he packed them into packages of 7, he had no left over. What is the
smallest number of eggs he could have had in the shipment?

Step 1: Understand the Problem

● A farmer needs to figure out how many eggs he lost, but the only way for him to
find out is through recalling how he packed his eggs.
● For every time he packed the eggs into 1,2,3,4,5 and 6 divisions, there’s always
an extra. However, if he packs his eggs into 7 the remainder will be equal to
zero.
● In solving this problem, our main aim is to find the multiples of seven.
​ Step 2: Devise a plan
● From the given we can get the LCM of 1,2,3,4,5 and 6 which is 60.
● Notice that if you add 1 to 60 it becomes 61, so if you 61 divide 1,2,3,4,5 and 6,
all the remainder is 1.
● Any multiple of 60 plus 1 will give us the same remainder.
● So in order for us to solve the problem we must create a formula stating that a
counting number with a multiple of 60 plus 1 should be equal to any number
divisible by 7.
60n + 1 = 7n
60n = any number with a multiple of 60
7n = any number divisible of 7
 ● 60n + 1 is also equal to (8x7+4)n +1= 7m.Let’s assume that 4n + 1 is divisible by
7. Find a number that will make this conjecture true. 4n + 1 = 7m.

n=1 4(1) + 1 = 5
n=2 4(2) + 1 = 9
n=3 4(3) + 1 = 13
n=4 4(4) + 1 = 17
n=5 4(5) + 1 = 21

substitute n = 5 to 60n + 1, the answer will be 301.

Therefore, the smallest number of eggs in the shipment is equal to 301.

Step 4: Review the solution

● We have arrived at our answer through a formula that aims to get a number,
when divided by 1,2,3,4,5 and 6 gives a remainder 1 and when divided by 7
gives no remainder.

3​. ​Two players take turns at removing 1 to 4 coins from an original pile of 16 coins. The
one who takes the last coin wins. Is there a winning strategy for either player?

Step 1: Understand the Problem.

● The problem is asking for a strategy for a player to always win.
● The main solution to this kind of problem is to always have a remainder.
​ Step 2: Devise a plan
● In order for a player to win every single game, he/she must follow this diagram.

● Let n be equal to the number of coins on the pile, r be equal to the remainder
of the remaining coins divided by 4 and x be equal to the number of coins that
a player should get from the pile.

I. Strategy 1
● For every turn, regardless of which player comes first, the number of coins that
a certain player should get is equal to the remainder of the remaining coins on
the pile divided by 4.
Solution:
In order for a player to win, x should be equal to r.
 II. Strategy 2
● If m is divisible by 4, in order for n to have a remainder(r), the player should get
a number of coins in such a way that n can not be divisible by 4. Due to this,
the player can only get 1 up to 3 coins for that turn. If the player will get 4, the
pile of coins will remain divisible by 4 which is not the goal.
Solution:
If n is divisible by 4, 1 ≤ x ≤ 3.

III. Strategy 3
● If the number of coins on the pile divided by 4 is equal to or greater than one
but less than 2, a player should get a number of coins that is less than the
remainder of the number of coins on the pile divided by 4.
Solution:
If 1 ≤ n < 2, x < r
4

Step 3: Carry out the plan.

● Initially, since there are 16 coins which are divisible by 4, player 1 should
perform strategy 2.

if n is divisible by 4, 1 ≤ x ≤ 3.

● If player 1 got 3 coins, 13 coins will be left.

16 − x = n
16 − 3 = 13

● Let’s assume that player 2 got 4 coins, which is the highest possible number of
coins a player can get
n−4=9
● Since 9 is not divisible by 4, Strategy 1 should be used by player 1.
n = 9 = 2 41 ​ *1 is the remainder
4 4

● x should be equal to r, therefore player 1 should get 1 coin.

● Now let us assume that player 2 gets 4 coins, n will become 4.
● Since 1 ≤ 4n < 2, player 1 should use strategy 3.
if 1 ≤ n < 2, x < r
4

● However, in this case, only 4 is left, which means if a player 1 has common
sense, he will be getting all 4. The game ends, player 1 wins!
Step 4: Review the solution.
● We have reached our solution through following the diagram and applying the
universal and conditional statements.
● At all instances, regardless of which player comes first, as long as the player
uses the said strategies, he will win all the matches.

4. ​A goat is tethered by a 6 meter rope to the outside corner of a shed measuring

4 meters by 5 meters in a grassy field. What area of grass can the goat graze?

Step 1: Understand the Problem

● “Find the area”. This problem concerns itself with geometry, so

we must tackle it as such.
● Visualization in this specific example will help immensely, so that
will be utilized as well.

Step 2: Devise a plan.

● We have done something like this before, it is mainly about

“seeing” the picture.
● In this case, drawing out a figure based on the problem, with
markers representing the respective distances and the like.

Step 3: Carry out the plan

 2
A= πr

π (G)2 = 113.4 → 3/4 → 84.825

π (2)2 = 12.57 → 1/4 → 3.1425 88.7525 m2

π (1)2 = 3.14 → 1/4 → 0.785

Step 4: Review the solution

 ● Answer satisfies the criteria (a value for the Area was found),
and is reasonable given the method used.

5. PALINDROMIC NUMBERS : page 98 #41

Step 1: Understand the problem

● The problem is asking for the smallest palindromic number larger

than 1000 that is a multiple of 5.

Step 2 : Devise A Plan

● For the palindromic number to be larger than 1000, the number

must have at least 4 digits.
● Multiples of 5 must either end in 5 or 0.
● The palindromic number in this case must start and end in 5, a
non-zero digit, to arrive with 5 X X 5 since having zero as the first
and last digit would look like 0 X X 0 where the leading zero
would be disregarded, thus leaving us with a 3-digit
non-palindromic number.
● Assuming the remaining digits in the middle to be zero would
make the smallest palindromic number.

Step 3: Carry out the plan.

● Following the plan we have in step 2, we will have:

➔ X X X X
➔ 5 X X 5 or 0 X X 0
➔ 5 X X 5
➔ 5 0 0 5

Step 4: Review the solution.

● 5005 > 1000

● 5005 ends in 5 therefore it is divisible by 5. Thus, it is a multiple
of 5 .
● 5005 read from left to right is still 5005 when read from right to
left.
● Therefore, 5005 is the smallest palindromic number larger than
1000 that is a multiple of 5.
6. NUMBER OF DIFFERENT ROUTES : page 99 #14

Step 1: Understand the Problem.

● Find how many direct routes.

● Direct = no turning back away from goal.
● Answer should be a solid integer, as the question asks “how
many”.

Step 2: Devise a plan

● Something similar was encountered and done in class before,

where we combine the spaces and values to come up with our
result. We need only replicate and the method used.

Step 3: Carry out the plan.

Step 4: Review the solution.

● Answer satisfies the criteria (is an integer) and is reasonable

based on the applied method.

7. AGES OF CHILDREN : page 100 # 16

Step 1: Understand the Problem

● The problem is asking for the ages of the Children in the Rivera
family.
Step 2: Devise a plan

● Represent each of the 4 clues that are given using symbols of

equality and inequalities.
● Use deductive reasoning to determine their respective ages.

Step 3: Carry out the plan

A. Reynaldo is older than Ramiro: Reynaldo > Ramiro

B. Sasha is younger than Shakira: Sasha < Shakira
C. Sasha is two years older than Ramiro: Sasha = Ramiro + 2
D. Shakira is older than Reynaldo: Shakira > Reynaldo
● Given the representations above, Sasha can either be 15 or 7
years old if she is two years older than Ramiro. If she is 15 , then
she is the oldest, which contradicts the second clue that she is
younger than Shakira. Hence, Sasha is 7 years old and Ramiro is
5 years old. With 15 and 13 as the only remaining ages left , clue
number 4 tells us that Shakira is 15 years old and Reynaldo is 13
years old since she is older than Reynaldo.

Step 4: Review the Solution.

a) Shakira is 15 years old

b) Reynaldo is 13 years old
c) Sasha is 7 years old
d) Ramiro is 5 years old

⟶ ​Shakira > Reynaldo > Sasha >Ramiro

● The solution satisfies the clues that Reynaldo (13) is older than Ramiro (5), Sasha (7) is
younger than Shakira (15); Sasha (7) is two years older than Ramiro (5); and Shakira
(15) is older than Reynaldo (13).

8. COUNTEREXAMPLE : page 100 #17

Step 1: Understand the Problem

● The Problem is asking for a counter example that would make the conjecture:

(x−4) (x + 3)
x−4
​= x+3

false.
Step 2: Devise a Plan
● Think of a number that when subtracted by 4 would be equal to 0 and plug it into the
equation to make the left side of the given equation undefined. This would make the
conjecture false.

Step 3: Carry out the plan.

● Let x = 4
● Then plugging x=4 to the given equation:

(x−4) (x + 3)
➔ x−4
​= x+3
We have,

(4−4) (4 + 3)
➔ 4−4
​= 4+3

(0)(7)
➔ 0 =7

0
“Indeterminate” ⟵ 0 =/ 7

Step 4: Review the solution

● When x=4, the conjecture would be false since upon plugging x=4 to the equation, the left
side would yield 00 , which is an indeterminate, while the right side would yield 7.

0 (x−4)(x+3)
● Therefore, arriving at 0 =/ 7 , we say that x−4 = x+3 is false given that x = 4.