UPSC Prelims 2026 CSAT Q23 · Numeracy
There are four types of weights, namely 1 kg, 2 kg, 5 kg and 10 kg. What is the maximum number of different ways one can measure 20 kg, if at least eight but not more than eleven weights of 1 kg are to be used while measuring?
- a7
- b8
- c9
- d10
Show answer & explanationHide answer
With 8, 9, 10 or 11 one-kg weights, the rest is made from 2, 5 and 10 kg weights in 3 + 1 + 3 + 1 = 8 distinct ways.
Statement-by-statement analysis
- 7 is an undercount. It usually comes from missing a case that uses the 10 kg weight.
- For 8 one-kg weights, the remainder 12 can be 10 + 2. This is easy to skip after listing 2×6 and 5×2 + 2.
- Dropping that case gives 2 + 1 + 3 + 1 = 7, but the correct count for 12 is 3, so the total is 8.
- With 8 one-kg weights, the remainder is 12: 2×6, 5×2 + 2×1, or 10 + 2×1, which is 3 ways. With 9, the remainder is 11: 5 + 2×3 only, which is 1 way.
- With 10 one-kg weights, the remainder is 10: 10, 5×2, or 2×5, which is 3 ways. With 11, the remainder is 9: 5 + 2×2 only, which is 1 way.
- Total = 3 + 1 + 3 + 1 = 8 ways.
- 9 results from also counting 12 one-kg weights, which breaks the 'not more than eleven' condition.
- With 12 one-kg weights, the remainder 8 = 2×4 gives 1 extra way, so 8 + 1 = 9.
- It can also come from wrongly accepting an odd remainder made only of 2 kg weights, for example 2a = 11, which has no whole-number solution.
- 10 results from ignoring the upper limit and allowing 12 and 13 one-kg weights.
- With 12, the remainder 8 = 2×4 gives 1 way. With 13, the remainder 7 = 5 + 2 gives 1 way. That makes 8 + 2 = 10.
- Both cases use more than eleven 1 kg weights, so they are invalid.
Concept to know
- This is a linear Diophantine counting problem. You count the non-negative integer solutions of 1·n1 + 2a + 5b + 10c = 20 under the given constraints.
- Fix the constrained variable first. Here n1 takes only the values 8 to 11, and each value fixes a smaller remainder R = 20 − n1.
- For each R, loop over the largest denomination first (c = 0, 1, …), then over b. Check whether the leftover is non-negative and even, so that it can be made from 2 kg weights.
- Parity rule: 2a + 10c is always even, so 5b must have the same parity as R. An odd R needs an odd b, and an even R needs an even b. This removes impossible cases instantly.
- A 'way' here means a different combination of counts (n1, a, b, c). The order in which weights are placed does not matter.
- Add the counts for each fixed value of n1 to get the final answer, which is 8.
Related facts for revision
- Coin and note change problems, such as 'in how many ways can Rs 50 be paid using Rs 2, 5 and 10 coins', use the same fix-the-largest-and-loop method.
- Two-pan balance variants allow weights on both sides. Each weight then has three states (left, right, unused), and the count changes completely, so read whether weights go on one pan only.
- In 'at least one of each weight' variants, subtract one of each weight from the target first, then count without that restriction.
- Questions of the type 'minimum number of weights to measure every value from 1 to N' use powers of 2 for one pan and powers of 3 for two pans.
- Number-of-solutions problems such as x + y + z = n with x, y, z ≥ 0 use the formula C(n+2, 2) when all coefficients are 1. Unequal coefficients need case listing, as in this question.
Systematic case enumeration under constraints, and use of parity to prune impossible combinations quickly.
Trap: Option (a) 7 tempts candidates who forget the 10 + 2 split for remainder 12. Options (c) 9 and (d) 10 tempt those who misread 'not more than eleven' and add n1 = 12 or 13. To save time, note that odd remainders (11 and 9) need exactly one 5 kg weight, so each gives just 1 way. Even remainders (12 and 10) give 3 ways each, which leads straight to 8.
More Numeracy PYQs
Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.