Question 64·200 Super-Hard SAT Math Questions·Advanced Math
The graphs of and intersect at two distinct points. If is an integer, which choice is the least possible value of ?
When a system has a parameter (like ) and you’re asked for the least value that makes two solutions, rewrite the equation to express the parameter as a function of (here, ). Then the number of solutions to is controlled by the minimum of : below it gives 0 solutions, at it gives 1, above it gives 2. With an integer restriction, the answer is the smallest integer strictly greater than that minimum—Desmos makes finding that minimum fast.
Hints
Turn the system into one equation
Set and solve for in terms of .
Think about how many times a horizontal level is hit
Let . The intersections are the solutions to . How many solutions happen when is below, at, or above the minimum of ?
Estimate the minimum efficiently
Graph (or use a table). Find the smallest -value it reaches, then pick the smallest integer strictly greater than that value.
Desmos Guide
Create a slider line and the exponential
Enter
When you type , Desmos will create a slider for it.
Find when the graphs change from 0 to 2 intersections
Move the slider for downward until the graphs stop intersecting. Then move it upward slowly to see the smallest values where two intersection points appear.
Check integer values only
Since must be an integer, test , , and on the slider and count the intersection points each time.
Alternative: graph the needed b-value function
Instead enter . The minimum -value of this graph is the cutoff. Choose the smallest integer greater than that minimum so that would intersect twice.
Step-by-step Explanation
Rewrite the intersection condition in terms of b
At intersection points, :
Solve for :
So each gives the value of that makes the line pass through the point .
Connect “two intersections” to a minimum value
Consider the function
For a given integer , intersections correspond to solutions of .
Because bends upward while is linear, decreases at first and then increases, so it has a single lowest point (a minimum). That means:
- If is below the minimum of , there are no intersections.
- If equals the minimum, there is one intersection (the graphs just touch).
- If is above the minimum, there are two intersections.
Approximate the minimum of
Use a calculator/Desmos to graph and estimate its lowest value.
From the graph (or a table of values near where it bottoms out), the minimum occurs near and the minimum value is approximately
Choose the least integer b that is above the minimum
To get two intersections, must be greater than about .
The least integer greater than is .
Therefore, the least possible value of is .