Key concept being tested: Data Sufficiency with Quadratic Functions — specifically, understanding when a downward-opening parabola can intersect a horizontal line at most once within a given domain.
Setup: P(t) = -0.2t^2 + kt - 15, where k > 0. The parabola opens downward (coefficient of t^2 is negative). We want to know: during t in [0, 24], does profit equal $m thousand at most once?
Setting P(t) = m gives us: -0.2t^2 + kt - (15 + m) = 0, or equivalently 0.2t^2 - kt + (15 + m) = 0.
The key insight: use the product of roots from Vieta's formulas.
1. For this quadratic in t: product of roots = (15 + m) / 0.2 = 5(15 + m).
2. Evaluate Statement (1): m < -15.
If m < -15, then 15 + m < 0, so the product of roots = 5(15 + m) < 0.
A negative product of roots means one root is negative and one is positive.
The negative root is outside our domain t >= 0, so within [0, 24], P(t) = m at exactly one t-value (or zero times if the positive root > 24).
Either way, "at most once" — Statement (1) ALONE is SUFFICIENT.
3. Evaluate Statement (2): k < m.
This tells us m > k > 0, so m is positive. The maximum value of the profit function is P_max = k^2/0.8 - 15. Statement (2) does not pin down k or m precisely enough to determine whether the line y = m crosses the parabola once or twice within [0, 24]. INSUFFICIENT.
Answer: A
Common trap: Many students try to analyze the vertex location or plug in numbers for k, rather than using Vieta's product-of-roots shortcut. The moment you write the equation P(t) = m in standard form, checking the sign of the product of roots immediately tells you whether both solutions are on the same side of zero.
Takeaway: On DS questions with quadratic equations, Vieta's formulas (sum and product of roots) can often settle sufficiency faster than solving directly.