Combination Subtraction (new)

Suppose that n n identical promo coupons are to be distributed to a group of people, with no assurance that everyone will get a coupon. If there are 165 more ways to distribute these to four people than there are ways to distribute these to three people, what is n n ?

11 10 9 12

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Mark Hennings
Jan 7, 2021

There are ( n + 3 3 ) \binom{n+3}{3} ways of distributing n n identical objects among four people, and ( n + 2 2 ) \binom{n+2}{2} ways of distributing n n identical objects among three people. Thus we want ( n + 3 3 ) ( n + 2 2 ) = 165 1 6 ( n + 3 ) ( n + 2 ) ( n + 1 ) 1 2 ( n + 2 ) ( n + 1 ) = 165 1 6 n ( n + 1 ) ( n + 2 ) = 165 \begin{aligned} \binom{n+3}{3} - \binom{n+2}{2} & = \; 165 \\ \tfrac16(n+3)(n+2)(n+1) - \tfrac12(n+2)(n+1) & = \; 165 \\ \tfrac16n(n+1)(n+2) & = \; 165 \end{aligned} and hence n = 9 n = \boxed{9} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...