Am I correct? will mark brainliest
1 answer:
You might be interested in
Answer:
755,160 ways
Explanation:
We're told that 31 cars are in a race.
Considering the order in which the cars can finish in the top 4 positions, any of the 31 cars can finish in the first position, any of the remaining 30 cars can finish in the second position, any of the remaining 29 cars can finish in the third position and any of the remaining 28 cars can finish in the fourth position, so the different numbers of ways can be determined as seen below;
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.