Skip to main contentSkip to solution

A donation box can receive only cheques of Rs. 100100, Rs. 250250, and Rs. 500500. On one good day, the donation box was found to contain exactly 100100 cheques amounting to a total sum of Rs. 1525015250. Then, the maximum possible number of cheques of Rs. 500500 that the donation box may have contained, is

Entered answer:

Solution

✅ Correct Answer: 12

Let us define:

x = number of Rs. 100 cheques

y = number of Rs. 250 cheques

z = number of Rs. 500 cheques

From the problem, we can write two equations:

Total number of cheques = 100

x+y+z=100x + y + z = 100

Total value = Rs. 15250

100x+250y+500z=15250100x + 250y + 500z = 15250


Since we want to maximise z, we need to eliminate one variable to work with a simpler equation.

From the first equation: x=100−y−zx = 100 - y - z

Substituting into the second equation:

100(100−y−z)+250y+500z=15250100(100 - y - z) + 250y + 500z = 15250

10000−100y−100z+250y+500z=1525010000 - 100y - 100z + 250y + 500z = 15250

10000+150y+400z=1525010000 + 150y + 400z = 15250

150y+400z=5250150y + 400z = 5250

Dividing everything by 50:

3y+8z=1053y + 8z = 105


y=105−8z3y = \dfrac{105 - 8z}{3}

For this to be a valid solution, yy must be a non-negative integer.

For y≥0y \geq 0:

105−8z3≥0\dfrac{105 - 8z}{3} \geq 0

105−8z≥0105 - 8z \geq 0

z≤1058=13.125z \leq \dfrac{105}{8} = 13.125

Since z must be an integer: z≤13z \leq 13


For y=105−8z3y = \dfrac{105 - 8z}{3} to be an integer, (105−8z)(105 - 8z) must be divisible by 3.

Since 105=3×35105 = 3 \times 35 is divisible by 3, we need 8z8z to also be divisible by 3. The largest multiple of 33 that is ≤13≤ 13 is z=12z = 12.


The maximum possible number of Rs. 500 cheques is 12.

Keyboard Shortcuts

  • Left arrow: Previous question
  • Right arrow: Next question
  • S key: Jump to solution
  • Q key: Jump to question