Teacher Roberto Partida:
|
Week 8: |
Problem of the Week : Patterns
1)
1. Problem Statement
Can we use 1,176 blocks to construct a stare like structure?
2. Process
we had to build an equation using the number of blocks given to creat a stare case, we have to take the equation, simplify it and take that equation to find a number if rows, we have to take this number of rows and add each by one block to get a number close to the blocks original number.
3. Solution
I came up with 47 rows in order to get 1,176, I got this from solving one equation and ultimatlly getting 1,035 and adding a block to each row in order to see if I can get the original amount of blocks.
4. Extension/Reflecton
This is simple because there are many ways to solve this by solving and plugging in numbers and guestimating in order to multiply numbers.
2)
problem statement:
can we use 2,628 toothpicks to make a stare case/ structure.
process:
I had to double what I did in the original equation in order to get close to 2,628, we have to find an equation in order to simplify it and find a certain number of rows.
solution:
since we are doubling what we did last time I got a total of 92 rows, we then got 2,652 blocks inbetween it in all.
Reflection:
this is simple because we completely had to double the number of the equations in due to the fact the our new number is doubke the amount in the first problem.
3)
problem statement:
with a base of 98 how many blocks does the structure have in all?
Process:
This problem would not work due to the fact that 98 can not turn into a stare cause, instead I had to use 10 in order to get close to the original answer.
solution:
The closest we could get to the origanal problem is 85.5, not even the closest answer could complete the stare case properly.
Reflection:
This was challenging becasue 98 can not truely work in order to complete a stare case.
4)
Problem statement:
what is the minimum number of steps and maximum number of steps you can get inbetween 2,345 and 8,789.
process:
fist I had to guestimate on any number close to the orginal minimum of 2,345 and I had tomultiply the answer I got by 2 in order to exoand and get the maximum.
solution:
my first answer is 2,348: this is my minimum) and Fter multiplying this by 2 I had gotten my maximum of 4,694.
Process:
This is challenging becasue we have to make a guess at first due to the fact we dont know any specifics regarding the number.
1. Problem Statement
Can we use 1,176 blocks to construct a stare like structure?
2. Process
we had to build an equation using the number of blocks given to creat a stare case, we have to take the equation, simplify it and take that equation to find a number if rows, we have to take this number of rows and add each by one block to get a number close to the blocks original number.
3. Solution
I came up with 47 rows in order to get 1,176, I got this from solving one equation and ultimatlly getting 1,035 and adding a block to each row in order to see if I can get the original amount of blocks.
4. Extension/Reflecton
This is simple because there are many ways to solve this by solving and plugging in numbers and guestimating in order to multiply numbers.
2)
problem statement:
can we use 2,628 toothpicks to make a stare case/ structure.
process:
I had to double what I did in the original equation in order to get close to 2,628, we have to find an equation in order to simplify it and find a certain number of rows.
solution:
since we are doubling what we did last time I got a total of 92 rows, we then got 2,652 blocks inbetween it in all.
Reflection:
this is simple because we completely had to double the number of the equations in due to the fact the our new number is doubke the amount in the first problem.
3)
problem statement:
with a base of 98 how many blocks does the structure have in all?
Process:
This problem would not work due to the fact that 98 can not turn into a stare cause, instead I had to use 10 in order to get close to the original answer.
solution:
The closest we could get to the origanal problem is 85.5, not even the closest answer could complete the stare case properly.
Reflection:
This was challenging becasue 98 can not truely work in order to complete a stare case.
4)
Problem statement:
what is the minimum number of steps and maximum number of steps you can get inbetween 2,345 and 8,789.
process:
fist I had to guestimate on any number close to the orginal minimum of 2,345 and I had tomultiply the answer I got by 2 in order to exoand and get the maximum.
solution:
my first answer is 2,348: this is my minimum) and Fter multiplying this by 2 I had gotten my maximum of 4,694.
Process:
This is challenging becasue we have to make a guess at first due to the fact we dont know any specifics regarding the number.