how many different ways can 'n' number of toffees be disturbed among 4 students such that each student will get at least one toffee where 10<n<15?
Answers
Answered by
3
Answer:
I have a feeling it is 89.
divide that into 10 it leaves 9 remainder
divide that into 9 it leaves 8 remainder
divide by 5 it leaves 4 remainders.
you have to consider the cases where 10x+9=9y+8=5z+4 for integer amounts. It would make a nice linear programming question.
I hope it will be help you and plz make me brainliest
Similar questions