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
-
334 Solvers
-
378 Solvers
-
Factorions: Numbers that equal the sum of the factorials of their digits
77 Solvers
-
Self-similarity 2 - Every third term
60 Solvers
-
Return fibonacci sequence do not use loop and condition
711 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!