edited by
1,248 views
0 votes
0 votes
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.
edited by

1 Answer

Related questions

0 votes
0 votes
1 answer
2
0 votes
0 votes
1 answer
3
aditi19 asked Dec 10, 2018
385 views
this is an example taken from Rosen. but I’m unable to understand to understand the solution given therecan someone pls explain me in details
0 votes
0 votes
1 answer
4
tusharp asked Jul 14, 2018
421 views
I am not getting the (2n-1) factor. n^2 is for matrix mul and multiplication is being done (n-1) times. so n^2(n-1) is understood. But what is (2n-1)??