Imp 1 Pow

POW 17

Problem Statement

Ok this POW is kind of odd compared to the others. You have to find the maximum pieces of pie you can make with a certain amount of cuts. There are three questions to this POW. You have to first do what i just stated, which is #1. you then have to try and find a pattern which is 2a. 2B is you have to use the pattern to find the largest possible number of pieces from 10 cuts. 2C is you have to explain why its happening. 3 is you have to find a rule.

Process

this time the process was pretty structured for me, since it wasn't as open ended as the last pow for the answers i just approached at trying to solve1-3. Since the first was what i started with and thats part of the solution (and thats all i originally aimed for) I'm going straight to that.

Solution

1.-In out table. # cuts | Max # pieces

1| 2

2| 4

3| 7

4| 11

5| 16

6| 22

2.a. The pattern that is happening is you take the number of cuts and add it to the previous amount of pieces.

2.b. 7-29 8-37 9-46 [10-56] the first number represents the number of cuts, the second represents the number of pieces.

2.c. I think the reason why this is happening is because it adds its own piece, as well as dividing the others in two.

3. i know that the equation to this has something to do with sigma but I'm not quite sure how to put it into terms, but i know that the pattern that i found will work to getting any number of cuts to pieces if you go through with it until you get to where you want to.

Evaluation

personally i liked this pow, it was short and simple, perfect way to end the line of POWs that we did in class. There really isn't much else to say so I'm not going to waste any ink. Regards...