2024 CSAT — Q6
In the expression , is chosen from each at most two times. What is the smallest non-negative value of the expression?
Worked rationale
There are four operator slots, and each of may be used at most twice. We want the smallest value that is still . The natural floor to aim for is — if we can hit it, we are done, since nothing non-negative is smaller.
Construct it directly (respecting BODMAS — binds first):
Operator tally: twice, once, once — all within the “at most twice” cap. The value is exactly , which is the least possible non-negative result.
Answer: (d) 0.
Why the other options miss
- A missed a case: stops at an easy expression (e.g. mishandled) and reports without searching for a zero.
- B missed a case: finds a value of and quits, not testing whether is reachable under the “each at most twice” budget.
- C an arithmetic slip: targets parity-of- but slips on a sign or a precedence, landing on instead of the achievable .
Specialist insight
The phrase “smallest non-negative” is the whole game: it sets the target at , not at the global minimum (which could be deeply negative). So the task is a feasibility check — can a legal operator assignment make the expression exactly ? — not an optimisation. One clean witness () settles it; you do not need to enumerate all assignments. Always read the extremum direction first: “non-negative” caps the search at and saves you a full sweep.
"Smallest non-negative" means hunt for , not the most-negative value — and uses no operator more than twice.