What is the unit value of the 3 in 432
1 answer:
You might be interested in
Work the information to set inequalities that represent each condition or restriction.
2) Name the variables.
c: number of color copies
b: number of black-and-white copies
3) Model each restriction:
i) <span>It takes 3 minutes to print a color copy and 1 minute to print a black-and-white copy.
</span><span>
</span><span>3c + b
</span><span>
</span><span>
</span><span>ii) He needs to print at least 6 copies ⇒ c + b ≥ 6
</span><span>
</span><span>
</span><span>iv) And must have the copies completed in no more than 12 minutes ⇒</span>
3c + b ≤ 12
<span />
4) Additional restrictions are c ≥ 0, and b ≥ 0 (i.e. only positive values for the number of each kind of copies are acceptable)
5) This is how you graph that:
i) 3c + b ≤ 12: draw the line 3c + b = 12 and shade the region up and to the right of the line.
ii) c + b ≥ 6: draw the line c + b = 6 and shade the region down and to the left of the line.
iii) since c ≥ 0 and b ≥ 0, the region is in the first quadrant.
iv) The final region is the intersection of the above mentioned shaded regions.
v) You can see such graph in the attached figure.
2) Name the variables.
c: number of color copies
b: number of black-and-white copies
3) Model each restriction:
i) <span>It takes 3 minutes to print a color copy and 1 minute to print a black-and-white copy.
</span><span>
</span><span>3c + b
</span><span>
</span><span>
</span><span>ii) He needs to print at least 6 copies ⇒ c + b ≥ 6
</span><span>
</span><span>
</span><span>iv) And must have the copies completed in no more than 12 minutes ⇒</span>
3c + b ≤ 12
<span />
4) Additional restrictions are c ≥ 0, and b ≥ 0 (i.e. only positive values for the number of each kind of copies are acceptable)
5) This is how you graph that:
i) 3c + b ≤ 12: draw the line 3c + b = 12 and shade the region up and to the right of the line.
ii) c + b ≥ 6: draw the line c + b = 6 and shade the region down and to the left of the line.
iii) since c ≥ 0 and b ≥ 0, the region is in the first quadrant.
iv) The final region is the intersection of the above mentioned shaded regions.
v) You can see such graph in the attached figure.
Answer: The greatest number of plates Lenin can prepare = 4
and there will be 3 chickens and 4 rolls in each plate.
Step-by-step explanation:
Given: Lenin is preparing dinner plates. He has 12 pieces of chicken and 16 rolls.
To make all the plates identical without any food left over, the greatest number of plates Lenin can prepare = G.C.D.(12,16)=4
The number of pieces of chicken in each plate =
The number of pieces of rolls in each plate =
So, the greatest number of plates Lenin can prepare = 4
and there will be 3 chickens and 4 rolls in each plate.