Question 90·Hard·Linear Inequalities in One or Two Variables
A point in the coordinate plane must satisfy both of the following conditions:
What is the greatest integer value of for which such a point can exist?
(Express the answer as an integer)
For SAT questions about regions defined by linear inequalities that ask for a maximum or minimum value of a variable, first interpret each inequality as a line plus a shading direction. The extreme (maximum or minimum) values usually occur on the boundary where the relevant lines intersect, so set the corresponding equations equal, solve for the intersection, and then apply any extra condition (like “integer” or “positive”) to that value. Always check whether you should round up, round down, or use the exact value based on the inequality signs.
Hints
Visualize or think about the two inequalities
Try to think of (or sketch) the two lines and . One inequality wants points below a line, and the other wants points above another line. Where can they both be true at once?
Focus on the boundary where both are just satisfied
To find the largest possible that still works, consider the point where both inequalities are equalities: and . What happens if you substitute into the first equation?
Use the intersection to pick an integer
After you find the -coordinate where the lines intersect, remember the question asks for an integer . Think about which integers are less than or equal to that -value, and choose the greatest one.
Desmos Guide
Graph the boundary lines
In Desmos, enter 2x + 3y = 15 on one line and y = x + 4 on another line so you can see both boundary lines on the same coordinate plane.
Find their intersection point
Click on the point where the two lines intersect; Desmos will display the coordinates of this intersection. Focus on the -coordinate of this point.
Determine the greatest integer from the intersection -value
Look at the -coordinate you found and identify the greatest integer that is less than or equal to this value; that integer is the greatest for which a point can satisfy both inequalities.
Step-by-step Explanation
Understand the region described by each inequality
Rewrite each inequality as a line plus a shading rule:
- describes all points on or below the line .
- describes all points on or above the line .
Any point that works must lie in the overlap of these two regions.
Find where the boundary lines meet
To get the largest possible that still satisfies both inequalities, the point will sit right on both boundary lines at the same time.
So set and plug into (using equality because we are on the boundary):
Now simplify this equation.
Solve for the -coordinate of the intersection
Continue solving:
So the two lines intersect at (and some value). This is the largest real for which a point can satisfy both conditions.
Choose the greatest integer that works
The question asks for the greatest integer that still allows a point to satisfy both inequalities.
Since any valid must be less than or equal to , the greatest integer that is is .
So, the greatest integer value of for which such a point can exist is .