A donation box can receive only cheques of Rs. , Rs. , and Rs. . On one good day, the donation box was found to contain exactly cheques amounting to a total sum of Rs. . Then, the maximum possible number of cheques of Rs. that the donation box may have contained, is
A donation box can receive only cheques of Rs. , Rs. , and Rs. . On one good day, the donation box was found to contain exactly cheques amounting to a total sum of Rs. . Then, the maximum possible number of cheques of Rs. that the donation box may have contained, is
Entered answer:
Solution
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
Total value = Rs. 15250
Since we want to maximise z, we need to eliminate one variable to work with a simpler equation.
From the first equation:
Substituting into the second equation:
Dividing everything by 50:
For this to be a valid solution, must be a non-negative integer.
For :
Since z must be an integer:
For to be an integer, must be divisible by 3.
Since is divisible by 3, we need to also be divisible by 3. The largest multiple of that is is .
The maximum possible number of Rs. 500 cheques is 12.
Related questions:
CAT 2022 Slot 1