UPSC Prelims 2026 CSAT Q29 · Numeracy
Three variables x, y and z take values 2, 3, 4 or 5 such that their values are always distinct. If M and N denote the largest possible value and the smallest possible value, respectively, for the expression |(x × y) + z|; then M − N is
- a11
- b12
- c13
- d14
Show answer & explanationHide answer
M = 4 × 5 + 3 = 23 and N = 2 × 3 + 4 = 10, so M − N = 23 − 10 = 13.
Statement-by-statement analysis
- 11 comes from 22 − 11, where both z-values are badly chosen: 4 × 5 + 2 = 22 for the maximum and 2 × 3 + 5 = 11 for the minimum.
- The true maximum is 23, with z = 3 rather than 2. The true minimum is 10, with z = 4 rather than 5.
- So 11 is not the difference of the true extremes.
- 12 comes from making only one slip: 22 − 10 (z = 2 in the maximum) or 23 − 11 (z = 5 in the minimum).
- After using 4 and 5 for the product, the leftover values are 2 and 3, so z should be 3. After using 2 and 3 for the product, the leftover values are 4 and 5, so z should be 4.
- With the correct z-values the difference is 23 − 10 = 13, not 12.
- Maximum: the largest product is 4 × 5 = 20, and the larger leftover value is z = 3, so M = 23. The next best case, 3 × 5 + 4 = 19, is smaller.
- Minimum: the smallest product is 2 × 3 = 6, and the smaller leftover value is z = 4, so N = 10. The next case, 2 × 4 + 3 = 11, is larger.
- M − N = 23 − 10 = 13.
- 14 would need M = 24 or N = 9.
- M = 24 needs 4 × 5 + 4, which repeats the value 4. N = 9 cannot be reached because the smallest product is 6 and the smallest leftover value is 4.
- Both cases break the distinctness rule or the allowed values, so 14 is impossible.
Concept to know
- In an expression of the form xy + z with distinct positive values, the product term dominates. Assign the extreme values to the product first, then give z the best leftover value.
- Maximum: put the two largest numbers in the product and the largest remaining number in z. Minimum: put the two smallest numbers in the product and the smallest remaining number in z.
- Always check the nearest rival arrangement. For the maximum, 3 × 5 + 4 = 19 is less than 23. For the minimum, 2 × 4 + 3 = 11 is more than 10. This confirms the greedy choice.
- The modulus bars can be ignored here because every value is positive, so xy + z is always positive. They matter only when negative values are allowed.
- The distinctness condition means that once a value is used in the product, it cannot be used again for z. Track the leftover set explicitly.
- With only 4 values and 3 slots there are just 24 ordered (12 unique) cases. Brute-force listing is a safe fallback, but the greedy approach takes under 30 seconds.
Related facts for revision
- Variants with negative numbers (for example values from −3 to 3) make the modulus important. The minimum of |expression| may then be 0 or close to it, and two negatives can multiply into a large positive product.
- Expressions like x × y − z: here the maximum needs the smallest z and the minimum needs the largest z. Read the sign attached to each slot before assigning values.
- Expressions like (x + y) × z: the multiplier slot is the most powerful, so give z the extreme value first, then fill the sum.
- Digit-placement questions (largest or smallest product of two 2-digit numbers formed from given digits) use the same idea: put the extreme digits in the most heavily weighted places.
- If values may repeat, the extremes change (for example 5 × 5 + 5 = 30). Check whether the question says distinct, different, or allows repetition.
Optimisation under constraints: assigning a limited set of distinct values to the slots of an expression to get its maximum and minimum, while respecting the distinctness rule.
Trap: Option (b) 12 is the main trap. Candidates get the product right but pick the wrong leftover z (22 instead of 23, or 11 instead of 10). Some also try to reuse a value, which leads towards 14. Time-saver: write the leftover set beside each product and pick the larger leftover for M and the smaller for N.
More Numeracy PYQs
Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.