REPOST IT A BIT CLEARER sorry i was on caps and im to lazy to elete what i wworte and repost it
Answer:
Every ordered pair within this region will satisfy the inequality y ≥ x. Incorrect. The boundary line here is y = x, and the correct region is shaded, but remember that a dotted line is used for < and >. The inequality you are graphing is y ≥ x, so the boundary line should be solid.
Let b be the number of blue beads and g the number of green beads that Giovanni can use for a belt.
He's supposed to use a total of between 70 and 74 beads, so
70 ≤ b + g ≤ 74
The ratio of green beads to blue beads is g/b, and this ratio has to be between 1.4 and 1.6, so
1.4 ≤ g/b ≤ 1.6
For completeness, Giovanni must use at least one of either bead color, so it sort of goes without saying that this system must also include the conditions
b ≥ 0
g ≥ 0
(These conditions "go without saying" because they are implied by the others. g/b is a positive number, so either both b and g are positive, or they're both negative. But they must both be positive, because otherwise b + g would be negative. I would argue for including them, though.)
Let
and
be the sides of the rectangle. The perimeter is given to be 500m, so we are maximizing the area function
subject to the constraint
.
From the constraint, we find
so we can write the area function independently of
:
Differentiating and setting equal to zero, we find one critical point:
which means
, so in fact the largest area is achieved with a square fence that surrounds an area of
.
Answer:
the number if people in line when the booth opened.
Step-by-step explanation:
70-5x: the number goes down by 5 people per minute. So for example if it has been 10 minutes, 50 people would’ve been given their tickets.
