Question 33·Hard·Linear Inequalities in One or Two Variables
Consider the system of inequalities
where and are real numbers. What is the least integer value that can take so that the system has at least one solution ?
(Express the answer as an integer)
For systems of inequalities where you are asked for a range of one variable, first isolate the same variable (here, ) in both inequalities to get an upper and a lower bound. Then require that the lower bound be strictly less than the upper bound so that there is room for at least one value between them, and solve this resulting inequality for the other variable. Finally, pay close attention to whether the inequalities are strict and to any integer requirements before choosing the smallest (or largest) allowable value.
Hints
Turn both inequalities into bounds on the same variable
Try solving each inequality for . You should get one inequality that says is greater than something and another that says is less than something.
Think about when an can satisfy both bounds
If must be greater than one expression and less than another, what relationship must those two expressions have to each other for such an to exist?
Solve for and then handle the integer requirement
After you write an inequality in from the condition in Hint 2, solve it carefully. Then remember: must be an integer, and the inequalities are strict, so equality at the boundary does not produce a solution.
Desmos Guide
Graph the inequalities using for and for
In Desmos, let represent and represent . Enter the two inequalities:
2x - y < 7x + 5y > 40Desmos will shade the regions that satisfy each inequality; the overlap is where the system has solutions.
Use horizontal lines to test integer values of
To check a specific integer value of , graph a horizontal line such as y = 5, y = 6, y = 7, etc. For each line, look to see whether it passes through the overlapping shaded region. If it does, that means there is at least one (one value of ) that works for that .
Find the smallest integer -value that works
Start with a value of that clearly does not intersect the overlapping region, then increase by 1 each time (testing y = 5, y = 6, y = 7, and so on). The smallest integer -value for which the horizontal line intersects the overlapping shaded region is the least integer value of that makes the system solvable.
Step-by-step Explanation
Express each inequality as a condition on
Start by solving each inequality for in terms of .
From :
- Add to both sides:
- Divide by :
From :
- Subtract from both sides:
So must satisfy both
Translate the two conditions into one inequality in
For there to be at least one real value of that works, there must be some number that is greater than and less than .
That is only possible if the lower bound is strictly less than the upper bound:
(This uses a strict because must be strictly greater than and strictly less than .)
Solve the inequality for
Now solve
Multiply both sides by :
Move terms to group on one side and constants on the other:
So we get
Find the least integer that satisfies the condition
The inequality means must be greater than , not equal.
Compute or estimate :
So is between and (about ). The smallest integer greater than this is .
Therefore, the least integer value that can take so that the system has a solution is .