- #1

vaishakh

- 334

- 0

Since them manager has to give Rs.1000 to his employees, the amount last employee is fixed once the amount to other four are fixed. So it is the number of ways in which that amount can be given to the first four employees.

Now the four employees as a whole should get a minimum of Rs.200. in this case there is only one condition of distributing the amount among the four employees. If the total is Rs.201, then one of the employee gets Rs.51 and thus there are 4 conditions depending on to whom the extra amount is given. Thus the total of two conditions becomes 5. When the total becomes Rs.202, there can be 4 conditions with anyone of them getting Rs.52 and 6 conditions with any two of them getting Rs.51. thus the total becomes 15 if they have to be given utmost Rs.203.

Now I tried to find a relation between the numbers. I found that 1 in the first case is 4!/4!*0!. The 5 in next case is 5!/4!*1!. The fifteen in the next case is 6!/4!*2!. The next case also gives 35 which is again easy to verify and the formula also works as 7!/4!*3!. Thus they should be given utmost Rs.950 which happens to be the case 751st case and hence the answer should be 754!/4!*750!.

The need is to prove. So I have to support the formula given with statements. The first case is combination to four things taken all four at a time and the four objects are four sets of Rs.50. In the next case the fifth set is a set of Rs.51. And now since the sets of Rs.50 are considered as four different sets, the combination of which person should get Rs.51 also gets verified. Now in the third case there is a one more case of Rs.52. If any combination now contains Rs.51 as well as Rs.52, the set Rs.52 will become Rs.51 to make the total sum the same and thus the number of possible combinations will also not change. But when the total sum becomes Rs.950, the need is to prove that still the number of combinations will be same. Thus it is needed to prove that the combination of high amount will be adequately replaced by multiple usage of certain small amount sets. Can anybody help how to prove it?