Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (trojanpoem):

Number of ways to multiply n matrices formula

OpenStudy (michele_laino):

do we multiply \(n\) matrices?

OpenStudy (trojanpoem):

The question asks for the number of ways to multiply the n matrices. for e.x: ABC = (AB)C = A(BC) (Number of ways = 2)

ganeshie8 (ganeshie8):

https://en.wikipedia.org/wiki/Catalan_number

OpenStudy (trojanpoem):

Thanks.

OpenStudy (trojanpoem):

but I got a question, can I use this formula ? Combination of (number of choices) choose (two) = result result - 1

ganeshie8 (ganeshie8):

I feel the purpose of the question is to derive that formula, not simply to use it...

OpenStudy (trojanpoem):

If so, I won't be able to prove your formula ( I won't copy & paste proof of course). well, how about this ? how to prove it ? https://allaboutalgorithms.files.wordpress.com/2011/11/parenthesis.jpg?w=595

OpenStudy (michele_laino):

Using a reasoning from statistical mechanics, I got this result: \[\Large \frac{{\left( {2n - 2} \right)!}}{{n!\left( {n - 1} \right)!}}\] it works for \(n=1,2\)

OpenStudy (michele_laino):

where, of course, \(n\) is the number of the involved matrices

OpenStudy (trojanpoem):

n = 3 , result = 2 n = 4, result = 5 Check your formula.

OpenStudy (michele_laino):

for \(n=4\), we get: \[\Large \frac{{\left( {2n - 2} \right)!}}{{n!\left( {n - 1} \right)!}} = \frac{{\left( {8 - 2} \right)!}}{{4! \cdot 3!}} = \frac{{6!}}{{4! \cdot 6}} = \frac{{4! \cdot 5 \cdot 6}}{{4! \cdot 6}} = 5\]

OpenStudy (michele_laino):

whereas for \(n=2\), we get: \[\Large \frac{{\left( {2n - 2} \right)!}}{{n!\left( {n - 1} \right)!}} = \frac{{\left( {4 - 2} \right)!}}{{2! \cdot 1!}} = \frac{{2!}}{{2 \cdot 1}} = \frac{2}{2} = 1\]

OpenStudy (michele_laino):

finally, for \(n=3\), we can write: \[\Large \frac{{\left( {2n - 2} \right)!}}{{n!\left( {n - 1} \right)!}} = \frac{{\left( {6 - 2} \right)!}}{{3! \cdot 2!}} = \frac{{4!}}{{12}} = \frac{{24}}{{12}} = 2\]

OpenStudy (trojanpoem):

Awesome! nice indeed.

OpenStudy (trojanpoem):

Is there a way to verify if it will lag in bigger numbers ?

OpenStudy (trojanpoem):

How about verifying it using this formula ? https://allaboutalgorithms.files.wordpress.com/2011/11/parenthesis.jpg?w=595

OpenStudy (michele_laino):

I don't know. I have used the same reasoning in order to get the \(Bose-Einstein\) statistics

OpenStudy (trojanpoem):

Bose - Einstein ? what is that ?

OpenStudy (michele_laino):

it is a topic of Statistical Mechanics!

OpenStudy (trojanpoem):

So it's right :),

OpenStudy (michele_laino):

if we make this variable change: \(m=n-1\), we get: \[\huge \frac{{\left( {2n - 2} \right)!}}{{n!\left( {n - 1} \right)!}} = \frac{{\left( {2m} \right)!}}{{\left( {m + 1} \right)!m!}}\] namely, the same formula of @ganeshie8

OpenStudy (trojanpoem):

It's better for on the fly questions , Thanks a lot.

OpenStudy (michele_laino):

:)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!