POW 5

CUTTING THE PIE

Analise Gates

1. PROBLEM STATEMENT:
In this problem, we were introduced into a new way of cutting pies. We were
shown diagrams that showed different possible results for 2 cuts and 3 cuts in a pie.
The unique pie cuts showed us that the the number of cut pie pieces may vary
depending on where the the cuts are made. The purpose of this problem was to find out
what the largest number of pieces that can be produced from a given number of cuts.
2) PROCESS
To begin this process, I experimented with many different pie cuts. I drew out
many pies and experimented with the cuts. After I discovered the maximum number of
pieces per cut, I thought I was completely finished. I recorded my data into an In-Out
table, when I suddenly realised a pattern. After experimenting with more pie cuts, I
noticed that, like every other POW before it , this POW had a pattern that applied to all
pie cutting equations. This pattern helped me discover many other numbers on the InOut table.
3) SOLUTION
After discovering the pattern to this POW, I came up with a reivised version of the
pattern. The answers are below
If the number of lines drawn is "x", then the maximum number of pieces formed is
"y".
cuts
pieces of pie
x
y
------------..1
2
..2
4
..3
7
..4
11
..5
16
You started with one circle's area. Notice that when you draw the nth line, it adds
"n" new pieces. So the first line added 1 to the original 1 pie. The second nine added 2
pieces to the 2 that were already there. The third line adds 3, the fourth line adds 4, and
the fifth line adds 5 new pieces.

You would begin with the amount of pieces in the pie when cut. In the first
scenario, there is one cut line but two slices of pie. In the next, there are 2 cuts but 4
slices of pie, and in the next 3 cuts but 7 pieces. The pattern that I found was the
number of pieces is the previous number of pieces added with the amount of cuts in the
current pie. I first noticed this when I looked at the pie with 4 pieces and the pie with 7
pieces. I noticed that the amount of cuts the pie with 7 pieces had was 3, while the
previous pie had 4 pieces. If we just look at the numbers, 4 is 3 away from seven, as
shown below:
cuts
pieces of pie
x
y
------------..1
2
..2
4 -------> 7-3=4
..3
7
..4
11
..5
16
..6
22
..7
29
..8
37
..9
46
..10
56
This rule applies with every other scenario in the In-Out table. The pie with 4 cuts
and eleven pieces has a difference of 7.
This equation could be used to find the number of pieces that could be made by
any number of cuts.
3b) The largest number pieces of pie that can be cut from 10 cuts is 56 pieces of
pie. I used the pattern to discover this answer.
4) EVALUATION
I personally loved this POW. Not only was this problem in the thanksgiving theme, but it
was fun and somewhat easy. I had a wonderful time discovering the answers and
patterns to this POW. I would love to have more POWs like this. I was not stressed
about this POW over break because I felt as if I developed a very good understanding
of this problem from the start. I did not feel rushed. This was a very satisfying POW.

Analise Gates
POW 4
FREETHINKING FOOTBALL PLAYERS

PROCESS
In this problem, we were introduced to a football team that can only
score points with field goals and touchdowns. A field goal was 5 points and
touchdown is 3 points. We were asked to find the highest impossible score
for the Freethinkers. To find this, I first created a line of numbers 1-15.
From there, I marked/ crossed out all of the numbers that were impossible
for the free thinkers to score. I quickly realised that the the more the
numbers add up, the less impossible scores there. After a while, all of the
scores become possible.For the original problem, I realised that the highest
impossible score is 7. Any number after that is possible. After a while ALL of
the numbers become possible. After trial and error with similar problems, I
realised that this pattern applies to every number except for when 1 is one
of the scores, or if both of the scores are even. After finding the highest
impossible score for the original problem, I started trying other similar
problems to see the results. Most of these problems followed the pattern
that I found. I began to think that there must be a pattern or formula that
applies for all problems like these. Instead of counting each score to find
the highest impossible score, I found a formula that will apply for all of
these problems. This formula is; xy - x - y = z. To show prove this formula
right, I used the numbers 4 (touchdown) and 3 (field goal).
Formula
4(3) - 4 - 3 = z
4 x 3 = 12
12 - 4 = 8
8-3=5
z=5
Counting pattern
1 2 3 4 5 6 7 8 9 10
number 1, 2 , and 5 are impossible. All numbers after that are possible.
This means that 5 is the highest impossible number. The formula also
states that 5 is the highest impossible. I did trial and error over and over
again using this formula and found that this formula is possible. There are
many ways to solve not only the original problem, but many problems like
it.

CONCLUSION

I discover that the answer for the original problem is 7. 7 is the highest
impossible number because it is the only other numbers besides 1, 2 ,4
and 7 that are impossible and it is the highest of the four numbers. I found
this by lining up numbers 1-10 and finding all of the impossible scoring
systems. I also discovered this answer by using a proven formula. Both
proved the the highest possible score was 7.
The formula I used also helped me discover the patterns to this type of
problem.
( formula and answers are proven above )

EXTENTION
Is there is scoring system that would reach a highest impossible of 50-55??
EVALUATION
At first, I was very confused what the purpose of this problem was and how
I was supposed to solve it. It took me almost all of the 10 days to discover
what the purpose of the POW was and what the formula was. When I finally
understood it, found that this problem had a lot of academic significance. I
learned so many new things and I enjoyed working on this problem. I
believe that I was accurately challenged by this problem and I would love to
have more POWs such as this.

TRIAL AND ERROR

feild goal: 4
touchdown: 3
1 2 3 4 5 6 7 8 9 10
Highest impossible= 5
Formula
4(3) - 4 - 3 = z
4 x 3 = 12
12 - 4 = 8
8-3=5
z=5

POW3
Analise Gates
Period 1
PROCESS
After hard work and trying many different combinations, I discovered that the
Economical king can find which bag weighed the least in under 3 times of measuring.
The process of this is actually very simple. You already know that the king has 8 bags
of gold, and the first step everyone would think to take is to measure 4 bags on each
side. This is the step I took at first, but I quickly realized that it would take over 3 steps
to achieve. I continued to draw out bags and find different combinations until I found the
right one. As soon as I found it, I was mind blown. I realized that you have to start off
with three bags on each side of the scale, and have 2 left over. If the lighter bag
happens to be one of the six bags, then you would pick the lighter side and from there

measure 1 on each side with one bag left over. You will then choose accordingly to what
side is lighter. If it is neither, then you will know that the lightest bag is the 1 bag left
over. If the special bag happens to not be in the group of six bags, then you know that
the bag is one of the two extra ones. You will then measure those bags and pick
accordingly. This process is not only very easy, but it is fast and under three steps. As
soon as I understood this process, it seemed like childs play.

SOLUTION
Although the king could have chosen many alternative routes to find the lighter bag of
gold, the quickest and easiest way to measure his gold was to put three on each side,
and that would only take 2 steps of measuring and to measure the 2 bags left over,
which would only take 1 step. This is the quickest process to find who stole the kings
gold.

{The drawn out process is on the next page}

EXTENTION
There was once a very greedy llama. He was the king of the Llamas, and oh did he
love his hats. The king hat the most valuable gold hats, so he hid them to protect them.
He had 12 very valuable hats that he gave to his trusteed llama friends all throughout
the kingdom. One day, rumor was heard that one of the hat keepers has been eating
parts of the hat off! The king was furious, but he didnt know who the hat eater was. He
called in all of his trusted friends to discover which hat had been eaten. He would then
weigh all the hats to discover who had been cheating him.
Your job is to find a combination that would take the king less than 4 times of measuring
to discover what hat weighed the lightest.

My reaction to this problem at first was not good. I was very confused what we had to
do, because I thought we had to weigh actual bags of gold (which I didnt have). Then, a
peer of mine pointed out what we were actually doing and I was no longer confused.
Found this problem very fun and I enjoyed it a lot. Please do another POW like this!

POW 2
Analise Gates
Period 1
09/28/15

HOW MANY SQUARES?

Process
1. For the first part of this problem, we were asked to discover how many different sized
squares are in an 8 by 8 checker board. As seen by the naked eye there are 64 one by
one squares. Unseen there are hundreds of other types of squares within this 8 by 8
checkerboard square, including 2 by 2 squares, 3 by 3 squares, and so on until 8 by 8.
First I tried counting every square, counting each individual square. This plan was a
complete and total disaster. Not only was I very confused during the process, but I was
unsuccessful in counting all of the squares. So I asked my brother for assistance with
this problem, he told me There is a pattern. So I went into deep thought, searching for
this pattern hinted to me by my brother. I noticed that there was indeed a pattern. There
are 64 one by one squares, and that there is one 8 by 8 square. The pattern is The small
number of squares is equivalent to the largest squares length multiplied by itself. It looks
a little something like this:
1x1=64 8x8=1
This pattern carries on throughout all the numbers from 1 to x (in this case x is 8, due to
it being the largest length of the square). After counting all of the various sizes of squares that fit
into this 8 by 8 square, I found my solution.
Solutions
1. There are in fact 184 squares in this 8 by 8 checkerboard. This was found by counting all
of the various sizes in the 8 by 8 square.
1x1=64
2x2=49
3x3=36
4x4=25
5x5=16
6x6=9
7x7=4
8x8=1

8x8=1
7x7=4
6x6=9
5x5=16
4x4=25
3x3=36
2x2=49
1x1=64

All of this above equals 184 squares.

Process pt. 2
For the second part of this problem, we were asked the same problem, just not an 8 by 8
square. How about we use the pattern we used for the first one, shall we? If we use the pattern
(a by a equals b times b and vice versa) with any sized checker board, it becomes a million

times easier to solve these problems. For example, let's say we have a 15 by 15 square, we can
plug in the numbers to the pattern to complete this problem, as shown below:
1x1=225
2x2=196
3x3=169
4x4=144
5x5=121
6x6=100
7x7=81
8x8=64
9x9=49
10x10=36
11x11=25
12x12=16
13x13=9
14x14=4
15x15=1

15x15=1
14x14=4
13x13=9
12x12=16
11x11=25
10x10=36
9x9=49
8x8=64
7x7=81
6x6=100
5x5=121
4x4=144
3x3=169
2x2=196
1x1=225

Using this pattern you can always confidently evaluate how many squares there are in a how
ever large checker board you have. boom.
Extensions
Using The pattern that you just learned, find how many squares are in a 30 by 30 square. How
many squares are all together on the checkerboard?

evaluations
At first, I thought that this problem was stupid and not worth while. I mean, we were counting
squares. Then I realized that this problem had a lot of significance. Not only was this problem
mind boggling and confusing but it was fun. After finding a pattern, I realized that I could find the
number of squares in ANY checkerboard I wanted. After I understood this problem, I started to
really enjoy it. I believe that this problem was the perfect POW. It was not too hard, but not too
easy. I really enjoyed this POW.

POW
Analise Gates
(Problem of the week)
1
09-08-15

per.

After searching for countless minutes, I finally found 2 possible

answers for how many eggs the farmer had in her truck. Our task
was to find how many eggs the farmer had in her truck when she
crashed it. You already knew that the farmer put the eggs in
groups of 7 because when she tried putting the eggs in groups of
2,3,4,5 and 6 she was unsuccessful. With the groups 2,3,4,5 and 6
there was always 1 egg left over. Finally when she tried 7 groups,
she had no eggs left over. To find how many eggs she had we had
to find a number that was a multiple of 7, ended with the number
1 and the number below it was divisible by 1, 2, 3, 4, 5 and 6.
After applying all these principles, we found a number that would
work. 301 is one possible answer for how many eggs the farmer
had. Next we found 721. This number follows all of these
principles and is another possible answer. Even though I only
solved 2 answers there are many many more answers that work
for this scenario. Over all, I believe that the farmer had 301 eggs
or 721 eggs when she crashed her truck.

Extension

Carrel was asked to deliver a truck load of hats to a store. On her

way to the store, her truck suddenly caught on fire. Unfortunately,
she lost all of her hats to the fire. Carrel went to her insurance
agent and he asked how many hats she had in her truck. She
didnt know but she did know that the number of hats she had
was a factor of 5 and the hats were grouped in groups of 5 and
there was always one hat left over in groups of 2,3, and 4.
Knowing this, your task is to find out how many hats she had in
her truck. Is there more than one possibility for the number of
hats she had?