2025 CSAT — Q7
How many possible values of are there satisfying , where , and are natural numbers (not necessarily distinct)?
Worked rationale
Order them and bound the smallest denominator. Since the three terms sum to , the largest term is at least , so ; and forces . Hence .
Case : then with . Now forces , giving , so . Solution , sum .
Case : then with . Bounding gives :
- : solution , sum .
- : solution , sum .
The three unordered solutions are , giving sums — three distinct values of .
Answer: (c) Three.
Why the other options miss
- A solved the wrong question: assumes no integer solution exists (confusing “not necessarily distinct” with “must be distinct,” where only survives).
- B missed a case: finds the symmetric and stops, missing the two solutions with .
- D answered the sub-step, not the question: counts ordered triples (permutations: arrangements) instead of distinct values of the sum, which the question actually asks for.
Specialist insight
The engine of every unit-fraction equation is the bounding move: with , the smallest denominator is squeezed into a tiny range (). Here it pins in one line and the rest cascades. The planted trap is the ordered-vs-unordered confusion in option (d): the triples number more than three, but the question asks how many distinct values of the sum — and that is exactly . Read the target quantity precisely before counting.
Count distinct values of the sum ( = three), not ordered triples — and don't stop at the symmetric solution .