Problem 55310. Chain multiplication - 03
Following up the problem in 55305, you found the minimum number of multiplications needed to multiply a chain of matrices.
In this problem, you have to find out how many ways there exist to multiply the matrices.
For example, for ABC - there are two ways to parenthesize/multiply -- A(BC) or (AB)C.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers9
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
52547 Solvers
-
Find the alphabetic word product
3455 Solvers
-
2009 Solvers
-
992 Solvers
-
Given a window, how many subsets of a vector sum positive
870 Solvers
More from this Author174
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!