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
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1805 Solvers
-
Back to basics 23 - Triangular matrix
984 Solvers
-
Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]
374 Solvers
-
82 Solvers
-
76 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!