UPSC Prelims 2022 CSAT Q8 · Numeracy
A bill for ₹ 1,840 is paid in the denominations of ₹ 50, ₹ 20 and ₹ 10 notes. 50 notes in all are used. Consider the following statements :
1. 25 notes of ₹ 50 are used and the remaining are in the denominations of ₹ 20 and ₹ 10.
2. 35 notes of ₹ 20 are used and the remaining are in the denominations of ₹ 50 and ₹ 10.
3. 20 notes of ₹ 10 are used and the remaining are in the denominations of ₹ 50 and ₹ 20.
Which of the above statements are not correct?
- a1 and 2 only
- b2 and 3 only
- c1 and 3 only
- d1, 2 and 3
Show answer & explanationHide answer
All three statements are incorrect because in each case, the maximum possible value achievable with the remaining notes falls short of ₹ 1,840.
Statement-by-statement analysis
- Value of 25 notes of ₹ 50 is 25 × 50 = ₹ 1,250, leaving ₹ 590 to be covered by 25 remaining notes.
- Even if all 25 remaining notes are of the higher denomination ₹ 20, the maximum possible value is 25 × 20 = ₹ 500, giving a total of ₹ 1,750.
- Since ₹ 1,750 is less than ₹ 1,840, Statement 1 is mathematically impossible and incorrect.
- Value of 35 notes of ₹ 20 is 35 × 20 = ₹ 700, leaving ₹ 1,140 to be covered by 15 remaining notes.
- Even if all 15 remaining notes are of the highest denomination ₹ 50, the maximum possible value is 15 × 50 = ₹ 750, giving a total of ₹ 1,450.
- Since ₹ 1,450 is less than ₹ 1,840, Statement 2 is mathematically impossible and incorrect.
- Value of 20 notes of ₹ 10 is 20 × 10 = ₹ 200, leaving ₹ 1,640 to be covered by 30 remaining notes.
- Even if all 30 remaining notes are of the highest denomination ₹ 50, the maximum possible value is 30 × 50 = ₹ 1,500, giving a total of ₹ 1,700.
- Since ₹ 1,700 is less than ₹ 1,840, Statement 3 is mathematically impossible and incorrect.
Concept to know
- Linear systems under constraints: Express total note count as x + y + z = N and total value as 50x + 20y + 10z = V.
- Upper-bound feasibility testing: To quickly verify if a scenario is possible, assign the largest available denomination to all remaining notes to find the maximum possible sum.
- Integer and non-negativity constraints: Note counts x, y, and z must be non-negative integers.
- System of linear Diophantine equations: When there are fewer equations than variables, valid solutions must satisfy whole number constraints.
Related facts for revision
- Problems involving minimum or maximum number of coins or notes required for a specific sum.
- Diophantine linear equations with non-negative integer constraints in CSAT.
- Extreme case testing technique to eliminate options without solving full algebraic equations.
Logical deduction, upper-bound testing, and checking feasibility of linear constraints.
Trap: Candidates often misread Which of the statements are NOT correct? as Which are correct? or waste time trying to solve full linear systems instead of checking upper bounds.
More Numeracy PYQs
Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.