recategorized by
580 views
1 votes
1 votes

Let $(1+x)^n  = C_0+C_1x+C_2x^2+ \ldots +C_nx^n, \: n$ being a positive integer. The value of 

$$\left( 1+\frac{C_0}{C_1} \right) \left( 1+\frac{C_1}{C_2} \right) \cdots \left( 1+\frac{C_{n-1}}{C_n} \right)$$

is

  1. $\left( \frac{n+1}{n+2} \right) ^n$
  2. $ \frac{n^n}{n!} $
  3. $\left( \frac{n}{n+1} \right) ^n$
  4. $\frac{(n+1)^n}{n!}$
recategorized by

1 Answer

0 votes
0 votes

Here $C_k$ means $\binom{n}{k}$.

and $\binom{n}{k }$/$\binom{n}{k+1 }$=(k+1)/(n-k)


Therefore,$C_0$/$C_1$=1/(n-0) and $C_1$/$C_2$=2/(n-1), $C_2$/$C_3$=3/(n-2)...

so (1+$C_0$/$C_1$)*(1+$C_1$/$C_2$)*(1+$C_2$/$C_3$)....(1+$C_n$/$C_n-1$) =(1+1/n)*(1+2/(n-1))*(1+3/(n-2)).....(1+n/(n-n+1))

=((n+1)/n)*((n+1)/(n-1))*((n+1)/(n-2))....*((n+1)/1)

=$(n+1)^{n}$/n!.

There fore option d is the right answer

Can some one edit this... i am new to latex

Related questions

1 votes
1 votes
3 answers
3
Arjun asked Sep 23, 2019
1,401 views
Let $A$ be a set of $n$ elements. The number of ways, we can choose an ordered pair $(B,C)$, where $B,C$ are disjoint subsets of $A$, equals$n^2$$n^3$$2^n$$3^n$
0 votes
0 votes
1 answer
4
Arjun asked Sep 23, 2019
768 views
Let $\sigma$ be the permutation:$$\begin{array} {}1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 \\ 3 & 5 & 6 & 2 & 4 & 9 & 8 & 7 & 1, \end{array}$$ $I$ be the identity permutation an...