Sign In
| 10 Theory slides |
| 15 Exercises - Grade E - A |
| Each lesson is meant to take 1-2 classroom sessions |
Here are a few recommended readings before getting started with this lesson.
Each of the following graphs represents the solution set of a certain inequality.
Pair each graph with its corresponding inequality.
As seen earlier, when two or more inequalities are graphed on the same coordinate plane, their solution sets may overlap. In these cases, the set of all inequalities being solved simultaneously forms a system of inequalities.
Notice that there is a region where the solution sets of the inequalities overlap. All the points in this region satisfy both inequalities simultaneously. Therefore, the overlapping region is the solution set of the system. In the next graph, only the common region is shaded.
Since the boundary lines in their entirety are not part of the solution set, they can be cropped to show only the edges of the overlapping region, or the exceeding parts can be drawn with lower opacity.
Jordan, feeling jolly, is thinking about giving gifts to her teammates — there are 30 players. Shopping at a stationery store, she decides it is best to buy some fancy ballpoint and fountain pens. She wants to spend less than $240 and is now unsure whether to give all or only some of her teammates a gift.
Let x and y be the number of ballpoint and fountain pens Jordan will buy, respectively.
With the first option, 19 teammates will receive a gift, while 20 teammates will get a gift with the second option. Therefore, if Jordan buys the maximum number of fountain pens she can, the maximum number of teammates that could get a gift is 20. Of those 20 teammates, only one would get a ballpoint pen.
Minimum: 101
Finally, Jordan was able to save enough money to buy a used car! She now plans to take a mini-road trip to visit a relative across-state. First, she will pick up her sister Ramsha, who lives in a different city. The travel distance depends on the path she chooses, but the entire route is no less than 990 kilometers. Jordan would like to drive for a maximum of 8 hours.
Jordan plans to drive at 70 kilometers per hour from her house to Ramsha's, and from there, she plans to increase the speed to 110 kilometers per hour until reaching her relative's house.
For each given system of linear inequalities, select the region corresponding to its solution set, if any.
Tearrik and Ramsha want to go on a road trip using Tearrik's father's car. As they plan to take turns driving, Tearrik wants to drive about 75 miles per hour while Ramsha plans to drive about 60 miles per hour. For each day, Tearrik's father recommended that they drive at least 420 miles but drive for less than 13 hours.
Before starting the trip, the friends decided that Ramsha will drive more hours than Tearrik every day.
Write a system of inequalities that models their situation and solve it graphically. Then, of the following polygons, select the one that resembles the shape of the solution set.
From the given information, the system we need to write will have three inequalities.
For all three inequalities, let x and y be the number of hours that Tearrik and Ramsha will drive each day, respectively.
It is given that the guys plan to drive less than 13 hours. We can write an inequality to represent this situation in the following way. x+y < 13
Tearrik will drive about 75 miles per hour and Ramsha about 60 miles per hour. Using the fact that the guys will drive at least 420 miles a day, we can write our second inequality. 75x +60y ≥ 420
The fact that Ramsha will drive more hours than Tearrik allows us to write the last inequality as follows. y > x
Having written each of the three inequalities, we can write the following system that models the trip. x+y < 13 75x +60y ≥ 420 y > x Let's solve the system graphically. To start, we write each inequality in slope-intercept form.
Let's continue by graphing the inequalities one at a time. We will start by writing the equation of the boundary line corresponding to the first inequality. ccc Inequality & & Boundary Line [0.5em] y< - x+ 13 & & y = - x+ 13 Since the inequality is strict, we will draw the boundary line dashed. To determine which region to shade, let's substitute (0,0) into the inequality.
Since we got a true statement we will shade the region containing the origin.
In a similar manner, let's write the boundary lines corresponding to the other two inequalities. We will also test an arbitrary point on each inequality to determine which region to shade.
Inequality | Boundary Line | Test Point | Region to Shade |
---|---|---|---|
y ≥ -5/4x + 7 | y = -5/4x + 7 Solid |
(0,0) ⇓ y &≥ -5/4x + 7 0 &? ≥ -5/4( 0) + 7 0 &≥ 7 * |
Not containing the origin |
y > x | y = x Dashed |
(1,0) ⇓ y &> x 0 &> 1 * |
Not containing the point (1,0) |
Using the information in the table, let's graph the last two inequalities. We will graph them on the same coordinate plane we graphed the first inequality.
Based on the context, x and y cannot be negative. Therefore, we need to limit the solution set to the first quadrant. Then, the solution set looks as follows.
Comparing the shape of the solution set to the four given polygon answer choices, we conclude that the correct choice is D.
Since y represents the number of hours that Ramsha drives in one day, and we are told that Ramsha drives for 5 hours on a certain day, then y=5. To determine the minimum integer number of hours that Tearrik has to drive that day, let's plot the line y=5 along with the solution set we found in the previous part.
Note that the minimum integer value of x that is inside the solution set and on the line y=5 is 2.
Consequently, the minimum integer number of hours that Tearrik has to drive to fulfill the daily goals is 2 hours.
Since x represents the number of hours that Tearrik drives in one day, and he said that the next day he will drive for 1 hour, then x=1. To determine the minimum integer number of hours that Ramsha has to drive the next day, let's plot the line x=1 along with the solution set we found in the Part A.
Note that the minimum integer value of y that is inside the solution set and on the line x=1 is 6.
Consequently, the minimum integer number of hours that Ramsha has to drive on this day to fulfill the daily goals is 6 hours.
To determine which of the polygons resembles the solution set, let's solve the system graphically. y < x+2 & (I) 8x-4y ≤ 24 & (II) 2x + y ≥ 2 & (III) y ≥ 0 & (IV) Note that the inequalities (I) and (IV) are already written in slope-intercept form, but inequalities (II) and (III) still need to be rewritten. Then, let's do it.
We can now proceed by graphing the inequalities starting with the first one. To do this, we identify the corresponding boundary line. ccc Inequality & & Boundary Line [0.25em] y < x+2 & & y = x+2 Since the inequality is strict, we will draw the boundary line dashed. To determine which region to shade, we will test (0,0) into the inequality.
We got a true statement, which implies that we have to shade the region containing the origin.
Let's summarize the computations for the other three inequalities in a table.
Inequality | Boundary Line | Test Point | Region to Shade |
---|---|---|---|
y ≥ 2x-6 | y = 2x-6 Solid |
(0,0) ⇓ 0 ? ≥ 2( 0)-6 0 ≥ -6 ✓ |
Containing the origin |
y ≥ -2x + 2 | y = -2x + 2 Solid |
(0,0) ⇓ 0 ? ≥ -2( 0)+2 0 ≥ 2 * |
Not containing the origin |
y ≥ 0 | y = 0 Solid |
(0,1) ⇓ 1 ≥ 0 ✓ |
Containing the point (0,1) |
Next, let's use all the information in the table to graph the last three inequalities on the same coordinate plane we graphed the first one.
Let's remove the parts that do not belong to the solution set.
Now that we can see the solution set clearly, and after comparing its shape to the six given polygons, we conclude that the polygon that resembles the solution set is C.