Values for and are to be selected from without replacement (i.e. no two letters have the same value). How many ways are there to make such choices so that the two curves and intersect? (The order in which the curves are listed does not matter; for example, the choices is considered the same as the choices )
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
Parabolas meet iff the larger leading coefficient pairs with the larger intercept; swapping B and D exchanges good and bad configurations, so exactly half of 180 work.
Solution
Setting the curves equal gives , so . Since all four values are distinct, neither side is zero, and a real solution exists exactly when and have the same sign: the parabola with the larger coefficient must also have the larger constant term.
Count the total first. There are ordered assignments, and swapping the two curves pairs them up without changing anything, so there are distinct pairs of curves.
Now pair each configuration with the one obtained by swapping only the constants . This flips the sign of while leaving alone, so it turns every intersecting pair into a non-intersecting pair and vice versa. Exactly half of the configurations intersect:
The answer is .
Why this works
Two upward parabolas with vertices on the -axis intersect only if the "steeper" one starts lower. Rather than counting the favorable configurations, find an involution (swap the intercepts) that exchanges good and bad configurations; then good and bad are equinumerous and the answer is half the total.
Alternative approach
Direct count: choose which of the values are used (), then decide which two are coefficients and which two are intercepts (); the larger coefficient must go with the larger intercept, a single valid pairing. Total .
The trap
Forgetting that the two curves are unordered, giving 180 (or 360) instead of 90.
Common mistakes
- Forgetting that the two curves are unordered, giving 180 (or 360) instead of 90.
- Requiring and to have opposite signs, which describes the parabolas that miss each other.
Techniques
Map the objects to something easier to count · Exploit symmetry to reduce work or pair up objects