Kenneth Rosen Edition 6th Exercise 6.1 Example 8 (Page No. 400)

Question

Find a recurrence relation for Cn  the number of ways to parenthesize the product of n+1 numbers , x0*x1*x2.......*xn , to specify the order of multiplication. For example C3 = 5 because there are five ways to parenthesize x0*x1*x2*.....*xn to determine the order of multiplication.

Comments

https://brilliant.org/wiki/catalan-numbers/  in this article i m stuck on this " which number of sequences are a₁,a₂ , ...." like what these a's represent here.

---

It means how many ways are there to arrange them in a sequence $a_{1} + a_{2} + a_{3} + ...........................+ a_{k}$ such that there partial sum satisfy $\sum_{k = 1}^{2n} a_{k} \geqslant 0$ for $1\leqslant k\leqslant 2n$

---

thnx

Answer 1

 sonam vyas 

what is initial condition T(0) AND T(1)??

Comments

if there a only 1 no , only 1 way to parenthesize it ..(itself)