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
-
961 Solvers
-
Program an exclusive OR operation with logical operators
717 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
100 Solvers
-
226 Solvers
-
37 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!