A line and a parabola can cross, touch, or miss each other. If a system asks for no real solutions, set the two expressions for equal and use the discriminant to test whether they miss. Then count the allowed integer values of the coefficients. A touch gives one solution, so the inequality must be strict.
Hints
- Hint 1
At a solution to the system, both equations give the same -value. Set their right sides equal, then move everything to one side to make a quadratic equation in .
- Hint 2
The discriminant is the part under the square root in the quadratic formula. A quadratic has no real roots only when its discriminant is negative, not when it is zero.
- Hint 3
Once you have an upper bound on for each , count the nonnegative integers below that bound. If the bound is a whole number, that number itself does not count.
Step-by-step
Use the discriminant, then count integer pairs
Step 1See what a missed intersection looks like
Try the allowed pair . Type , , and the two given equations into Desmos. The graphs do not meet in this window. An intersection is a point on both graphs, so this pair appears to work; algebra will give us a test that doesn't depend on the window.
- Step 2
Turn the system into one quadratic
At a point shared by both graphs, the two expressions for are equal. Set them equal:
Subtract the right side to put the equation in quadratic form:
- Step 3
Test for no real solutions
The discriminant of is , the number under the square root in the quadratic formula. Here and , so no real solutions requires:
A negative discriminant means the graphs never meet; zero means they touch once. A touch does not count here.
- Step 4
Find the allowed bound on
Expand :
Move the other terms to the right:
Divide by :
The strict sign keeps pairs whose graphs only touch out of the count.
- Step 5
Count the possible values for each
Type for the allowed -values, then for their bounds on . Desmos shows . Since is a nonnegative integer strictly below its bound, the corresponding counts are . For example, below you can use , but not . Every positive bound is below , so the upper limit on removes nothing else.
- Step 6
Add the counts
Type the counts as , then type . Desmos prints . Each count belongs to one different value of , so there are 13 ordered pairs for which the system has no real solutions. Grid in 13.