SO
HERE IS YOUR CHALLENGE:
Find all
the different combinations of these two sized pizzas that Garzon's machine
can make? Represent all of the possible answers on a coordinate grid.
HOW TO START:
Find pairs of numbers that indicate how many of each size pizza could
be made from a single use of the machine. For example, Garzon
certainly could make one large and one small, or five large and three
small pizzas. He would not be using his machine at its maximum capacity,
but he could do it. Use colored dots to represent these pairs of numbers
on your graph.
Now there
are also some combinations that simply could not work because he wouldn't
have enough dough. For example, he could not make 31 small pizzas
and no large pizzas, because the machine only makes 30 pounds of dough.
Choose a different color of dot on your graph to represent the
combinations that wont work.
This problem
will generate A LOT OF DOTS! You will need to determine how big your
x and y axes should be to accommodate all the
possible dots. Figure out the maximum number of large pizzas he can
make. Your x axis must be at least that long. Then figure
out the maximum number of small pizzas he can make. Your y axis
will need to extend at least that far. (This activity
is easier if you use an interval of one pizza per block on your graph
paper.)
TO
SET YOURSELF ABOVE THE REST:
STAR on your graph all the possible combinations that would indicate
that the machine is being used at its maximum capacity. (You will
recognize a pattern here if you do it correctly.)
When you are finished
click here to compare your graph to ours,
but remember, they might not be exactly the same if you used a different
scale than we did.
*****************************************************************************************************
Copyright © 1999-2020 themathlab.com