Let the count of ₹100, ₹250, and ₹500 cheques be \( x, y, z \) respectively.
The total number of cheques is \( x + y + z = 100 \).
The total value of the cheques is \( 100x + 250y + 500z = 15250 \).
From \( x + y + z = 100 \), we can express \( x \) as: \( x = 100 - y - z \).
Substituting this into the second equation yields: \[ 100(100 - y - z) + 250y + 500z = 15250 \] \[ 10000 - 100y - 100z + 250y + 500z = 15250 \] Combining like terms gives: \[ 150y + 400z = 5250 \]
Dividing the equation by 50 simplifies it to: \[ 3y + 8z = 105 \]. Our objective is to maximize \( z \), the number of ₹500 cheques.
We test integer values for \( y \) to find an integer solution for \( z \):
The maximum integer value for \( z \) is 12, which occurs when \( y = 3 \).
Using \( x + y + z = 100 \) with \( y = 3 \) and \( z = 12 \), we find \( x \):
\( x = 100 - 3 - 12 = 85 \).
Verification of total value: \[ 100 \times 85 + 250 \times 3 + 500 \times 12 = 8500 + 750 + 6000 = 15250 \] ✅ The total value matches the given amount.
The maximum number of ₹500 cheques is: \[ \boxed{12} \]