All School Math Exhibition:
- I presented the Colored Cubes problem of the week.
- I made sure that we had all the posters and cubes we needed in order to show people how to do the problem.
- I didn't get a chance to really teach the problem of the week because I was in the hall, and no one really stopped at my table.
Cookies Unit:
The cookies unit was about linear programming. In the cookies problem we were given four constraints, and we had to graph the equations, and find the feasible regions for the different graphs.
When this unit started, I didn’t know anything about linear programming or feasible regions. I now feel like I have a good understanding of it. I think I grew the most with feasible regions, I didn’t understand the inequalities at the beginning, so I couldn’t figure out where the feasible regions were. Now I can easily find them.
When this unit started, I didn’t know anything about linear programming or feasible regions. I now feel like I have a good understanding of it. I think I grew the most with feasible regions, I didn’t understand the inequalities at the beginning, so I couldn’t figure out where the feasible regions were. Now I can easily find them.
Cookies Graph:
POW 3 Nim:
Process: I played every possible way to play the original game. as a result of this, I developed many different strategies.
Strategies: A strategy I developed for the original game is if player 1 crosses of 3, player 2 will always win. Another strategy I developed is if each person alternately crosses off two player 1 will win. The beginning number variation I investigated is 15 NIM. The strategy I have for this is if player 1 crosses off 1 there is 2 more possible strategies in order for player 1 to win. I investigated 1 maximum per turn variations. A strategy I found is if player 1 crosses off 2, player 1 can always win.
Generalizations: If I am playing the original game, I will know who will win when there are 4 lines available. If I am playing a game when I can cross off up to 5 I will know who will win when there are 6 lines available.
Strategies: A strategy I developed for the original game is if player 1 crosses of 3, player 2 will always win. Another strategy I developed is if each person alternately crosses off two player 1 will win. The beginning number variation I investigated is 15 NIM. The strategy I have for this is if player 1 crosses off 1 there is 2 more possible strategies in order for player 1 to win. I investigated 1 maximum per turn variations. A strategy I found is if player 1 crosses off 2, player 1 can always win.
Generalizations: If I am playing the original game, I will know who will win when there are 4 lines available. If I am playing a game when I can cross off up to 5 I will know who will win when there are 6 lines available.