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
Follow Math Help Forum on Facebook and Google+
Originally Posted by sid_178 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 This is a good problem. What do you thin the answer is and why?
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 ?
Originally Posted by sid_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 ? Actually we assume that . Consider . So yes it is .
View Tag Cloud