Matrices of the same order can be checked for equality (A=B iff every corresponding entry matches), added (A+B=[aij+bij], entry-by-entry, undefined for mismatched orders), subtracted (A−B=A+(−B)), and scaled by a number (kA=[kaij], every entry multiplied by k). These operations obey familiar-looking laws — addition is commutative (A+B=B+A) and associative ((A+B)+C=A+(B+C)), the zero matrix is the additive identity, −A is the additive inverse, and scalar multiplication distributes over both matrix sums and scalar sums. The most common use is solving a linear matrix equation for an unknown matrix X (e.g. 3A−4B+5X=C): treat X exactly as you would an unknown number, isolating it algebraically, then compute the resulting combination of known matrices entry-by-entry. These "sum-and-scale" operations are the foundation on top of which matrix multiplication (a genuinely different, non-commutative operation) is built.
Grouping the additions differently gives the same final matrix both ways.
✓Final answer
(A+B)+C=A+(B+C)=56−8225
Given A=25−6−3−41, B=−120223, C=4−1−2341.