Finite Sequences

How many finite sequences x 1 , x 2 , , x m x_1,x_2,\cdots ,x_m are there such that each x i = 1 x_i = 1 or 2 2 , and i = 1 m x i = 10 \displaystyle \sum_{i=1}^{m} x_i = 10 ?

92 91 89 120

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

Jaydee Lucero
Jun 26, 2017

There are six possible cases:

For { 2 , 2 , 2 , 2 , 2 } \{2,2,2,2,2\} , there is only 1 1 possible sequence.

For { 1 , 1 , 2 , 2 , 2 , 2 } \{1,1,2,2,2,2\} , there are ( 6 4 ) = 15 \displaystyle{\binom{6}{4}}=15 possible sequences.

For { 1 , 1 , 1 , 1 , 2 , 2 , 2 } \{1,1,1,1,2,2,2\} , there are ( 7 3 ) = 35 \displaystyle{\binom{7}{3}}=35 possible sequences.

For { 1 , 1 , 1 , 1 , 1 , 1 , 2 , 2 } \{1,1,1,1,1,1,2,2\} , there are ( 8 2 ) = 28 \displaystyle{\binom{8}{2}}=28 possible sequences.

For { 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 2 } \{1,1,1,1,1,1,1,1,2\} , there are ( 9 1 ) = 9 \displaystyle{\binom{9}{1}}=9 possible sequences.

And, for { 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 } \{1,1,1,1,1,1,1,1,1,1\} , there is only 1 1 possible sequence.

Thus, all in all, there are 1 + 15 + 35 + 28 + 9 + 1 = 89 1+15+35+28+9+1=\boxed{89} possible sequences.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...