Question 212·Hard·Nonlinear Equations in One Variable; Systems in Two Variables
In the system of equations
and are integers with and . For how many ordered pairs does the system have no real solutions?
(Express the answer as an integer)
When a system pairs a line with a parabola, set the equations equal to eliminate and get a quadratic in . Then use the discriminant to control the number of intersection points: set it less than 0 for no real solutions, simplify the resulting inequality in the parameters, and systematically test the small integer range given (often by computing a short table) to quickly count how many parameter pairs work.
Hints
Eliminate
Since both equations equal , try setting equal to . What type of equation in does that give you?
Think about real solutions of a quadratic
Once you have the quadratic in , recall that the discriminant tells you how many real solutions it has. What inequality should that discriminant satisfy if you want no real solutions?
Express the discriminant in terms of and
Identify , , and in your quadratic, write the discriminant using and , set it less than 0, and then solve this inequality for .
Use the integer and range constraints
For each integer from 0 to 6, use your inequality to find all integer between 0 and 10 that work. Count how many values you get for each , then add those counts.
Desmos Guide
Graph the boundary curve in the -plane
From the algebra, you should have the condition for no real solutions as . In Desmos, let the horizontal axis represent and the vertical axis represent , and type the function:
This curve is the boundary separating where the discriminant is negative from where it is not.
Restrict to the allowed and ranges
In Desmos, type the inequalities
0 <= x <= 60 <= y <= 10
to shade the rectangle that represents all allowed integer pairs .
Shade the no-solution region and count integer points
Now type the inequality
This shades the region of for which the discriminant is negative (no real solutions). Look only inside the rectangle , , and count how many grid intersection points with integer coordinates lie in the shaded region. That count is the number of ordered pairs that satisfy the problem.
Step-by-step Explanation
Set the equations equal to eliminate
Because both expressions equal , set them equal to each other:
Move all terms to one side to get a standard quadratic in :
This equation must have no real solutions in for the system to have no real solutions.
Use the discriminant condition for no real solutions
For a quadratic equation
the discriminant is :
- If , there are 2 real solutions.
- If , there is 1 real solution (a tangent).
- If , there are no real solutions.
In our quadratic :
So the discriminant is
We want no real solutions, so we need
Solve the discriminant inequality for
Start from
Distribute the :
Move terms so that is on one side:
and divide by :
We must also remember the given conditions:
- is an integer with .
- is an integer with .
So for each integer from to , must be an integer between and that also satisfies this inequality.
Find all possible values for each integer
Compute the right side of
for each integer from to .
- :
With and integer , we can have → 5 values.
- :
So can be → 4 values.
- :
So can be → 3 values.
- :
So can only be → 1 value.
- :
But , so no values of work.
- :
Again, impossible with → 0 values.
- :
Also impossible with → 0 values.
So the numbers of valid values for are respectively
Add the counts to get the total number of ordered pairs
Each allowed pair corresponds to a choice of (from to ) and a that satisfies the inequality for that .
From the previous step, we have:
- 5 pairs when
- 4 pairs when
- 3 pairs when
- 1 pair when
- 0 pairs when
Add these:
So, there are 13 ordered pairs for which the system has no real solutions.