For how many ordered pairs of positive integers does neither nor have two distinct real solutions?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Both discriminants must be nonpositive: b^2 <= 4c and c^2 <= 4b, which force b, c <= 4; checking the 16 small pairs leaves 6.
Solution
A monic quadratic has two distinct real roots exactly when its discriminant is positive. We need both discriminants to be not positive:
(Equality is allowed: a double root is a single solution, not two distinct ones.)
Bound. Chain the inequalities: , so and . By symmetry as well.
Enumerate. For each from to , the conditions are and :
- : and , so .
- : and , so .
- : and , so .
- : and , so .
The pairs are : six in all.
The answer is .
Why this works
"Neither has two distinct real solutions" translates directly into two discriminant inequalities. Because each variable is bounded by a function of the other (, ), feeding one into the other produces an absolute bound, after which the search space is tiny. Read the wording carefully: "two distinct" means the boundary case (discriminant zero) counts as acceptable.
Alternative approach
Since the conditions are symmetric, assume first. Then gives , and listing with and , gives . The one pair with contributes its mirror , for a total of .
The trap
Requiring strictly negative discriminants (no real roots), which wrongly discards the double-root pairs (1,2), (2,1) and (4,4) and leaves only 3 pairs.
Common mistakes
- Requiring strictly negative discriminants (no real roots), which wrongly discards the double-root pairs (1,2), (2,1) and (4,4) and leaves only 3 pairs.
- Counting unordered pairs (getting ) or forgetting to bound and and missing .
Techniques
Bound the quantity above/below or estimate to pin it down · Organized listing / direct enumeration