The number of binary strings of n zeroes and k ones that no two ones are adjacent are :

(a)n-1Ck

(b)n+1Ck

(c)nCk

d)k+n-1Ck

Printable View

- May 14th 2010, 05:07 AMsid_178Number of binary Strings Problem
The number of binary strings of n zeroes and k ones that no two ones are adjacent are :

(a)n-1Ck

(b)n+1Ck

(c)nCk

d)k+n-1Ck - May 14th 2010, 05:44 AMPlato
- May 14th 2010, 07:57 AMsid_178
By Assumption ,say ,n>k..

Now ,if we keep n zeroes ..we have n+1 places out of which we can keep k ones

in n+1ck ways .Is that right ? - May 14th 2010, 08:09 AMPlato