In some problems of occupancy theory we are concerned with the number of ways in
ID: 3432505 • Letter: I
Question
Explanation / Answer
0 x 0 x 0 x 0 x 0
there are (5-1) positions for dividers, and we need to place only (3-1) dividers to divide the loaves to 3 customers
0 x 000 x 0 ,eg indicates 1 loaf to 1st customer, 3 to 2nd & 1 to 3rd
now the dividers can be placed in any of C(5-1, 3-1) ways,
and generalising for r loaves & n customers, the formula is
# of ways = C(r-1,n-1)
Related Questions
Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.