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 Solvers8
Suggested Problems
-
Count from 0 to N^M in base N.
234 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
595 Solvers
-
159 Solvers
-
264 Solvers
-
Check if a matrix Diagonal is equal to its secondary diagonal
32 Solvers
More from this Author165
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!