Could you please insert some punctuation into your big equation there? It's impossible to parse as is.
If A and B are n by n matrices with all entries equal to 1, find . Summation notation turns the product AB, and the law (AB)C=A(BC), into
Compute both sides if C is also n by n with every
I haven't even done any work on this yet, because first I don't even understand what the question wants, and second I don't even know where to begin.
That's how it's written in my book. I am not really after a solution, more like am more interested in how I could start working this out. What I think that this question is basically asking, is for a proof of the associative property using the above formulas, but I don't know where to start.
Thought I would let you know Ackbeet that I found the solution to be 2n^2, which made so much more sense after looking at your work, and learned something new about summations and matrices. I would like to thank you once again for giving me a new perspective between proofs, associative law, and computations with summations and matrices.