Ask your own question, for FREE!
Mathematics 19 Online
OpenStudy (anonymous):

How many different signals that can be given using any number of flags from 5 flags of different colors is?

OpenStudy (anonymous):

@ganeshie8

OpenStudy (anonymous):

@ParthKohli

Parth (parthkohli):

Wow, I totally hate these questions. :( Just make cases?

OpenStudy (anonymous):

idk the options are 325,525,425,625

ganeshie8 (ganeshie8):

\[\sum\limits_{n=0}^{5} \dbinom{5}{n}*n! \] should do right ?

Parth (parthkohli):

\[\binom{5}1\cdot 1! + \binom{5}2 \cdot 2! + \binom{5}3 \cdot 3! + \binom{5}4\cdot 4! + \binom{5}5\cdot 5!\]Almost like ganeshie's answer except \(n = 0\) is not there

ganeshie8 (ganeshie8):

yeah treating "no flags" as a signal makes no sense

OpenStudy (anonymous):

actually any any number of flags is what is bugging me and same color are identical

Parth (parthkohli):

I know, that language is confusing. It just means that you don't have to use all the flags to make a signal.

OpenStudy (anonymous):

so have to use only 5 at max?

ganeshie8 (ganeshie8):

It's like forming power set of a given set. In our case order matters

ganeshie8 (ganeshie8):

Suppose I give you a set with 5 elements. How many subsets can you make ?

OpenStudy (anonymous):

2^5-1

ganeshie8 (ganeshie8):

empty set is also a subset so 2^5 subsets in total, right ?

OpenStudy (anonymous):

ok..

ganeshie8 (ganeshie8):

Can you show me how you got 2^5 ?

OpenStudy (anonymous):

yep element 1 will have 2 choices whether to go or not same with rest

ganeshie8 (ganeshie8):

That is one nice way to look at it. But it is useless here

ganeshie8 (ganeshie8):

A more useful derivation of the same result is by considering different cases : 1) number of subsets with 0 elements= ? 2) number of subsets with 1 elements= ? 3) number of subsets with 2 elements= ? 4) number of subsets with 3 elements= ? 5) number of subsets with 4 elements= ? 6) number of subsets with 5 elements= ?

OpenStudy (anonymous):

nC0 + n C 1 ...... nC5

ganeshie8 (ganeshie8):

Yep! How to make that logic useful in our problem ?

Parth (parthkohli):

if it helps 5P1 + 5P2 + 5P3 + 5P4 + 5P5

OpenStudy (anonymous):

i get it..actually misunderstood the language thanks guys :)

OpenStudy (anonymous):

there one or two more I was trying to converge this series (2r+1) C r + (2r+1) C r-1 ........ (2r+1) C 1

Parth (parthkohli):

Oh, good. Add (2r+1)C0 then try to think what the relation of that sum and... (2r+1)C0 + (2r+1)C1 + ... + (2r+1)C(2r+1) is

ganeshie8 (ganeshie8):

You could also stare at pascal triangle a few seconds to get a feel of that sum...

OpenStudy (anonymous):

but the series is starting from 2r+1C r

ganeshie8 (ganeshie8):

|dw:1451221675754:dw|

OpenStudy (anonymous):

i never actually understood what the pascal triangle is for

ganeshie8 (ganeshie8):

Oh let me give you a brief introduction first then

OpenStudy (anonymous):

cool :)

ganeshie8 (ganeshie8):

Pascal triangle starts from the top row with 1 : |dw:1451221898909:dw|

ganeshie8 (ganeshie8):

Next row is created from the present row by doing below : 1) append 1's at left and right. 2) add two adjacent numbers in present row and put the result in the next row |dw:1451222118249:dw|

Parth (parthkohli):

is that because\[\binom{n}{r-1}+\binom{n}r = \binom{n+1}r\]

OpenStudy (anonymous):

yep

ganeshie8 (ganeshie8):

|dw:1451225308043:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!