There are 2 important equations for these types of arrangements
If the number of non negative integer solutions for the equation \(x_1 + x_2 \space + \space ..+ \space x_n \space = \space n\), then the number of ways the distribution can be done is:
(i) \(^{n+r−1}C_{r−1}\). In this case, value of any variable can be zero.
(ii) \(^{n−1}C_{r−1}\). In this case, minimum value for any variable is 1.
Given that: n = 7 erasers, r = 4 children and and each child should have at least one eraser, but the maximum should not exceed 3.
Total number of ways, where each child gets at least 1 eraser = \(^{n-1}C_{r-1} = \space ^{7-1}C_{4-1} = \space ^6C_3 = \frac{6 \space * \space 5 \space * \space 4}{3 \space * \space 2 \space * \space 1} = 20\)
These 20 also include the cases, where 1 child gets all 4 erasers. The total such cases is 4.
Therefore the required number of cases = 20 - 4 = 16
Option DArun Kumar