We know that 2 × 2s can always be multiplied together, and we know that the outcome must always also be a 2 × 2. Let's visualize it: Looking at where the intersections are, we can see which row of the first matrix and which column of the second matrix collide to come up with the product's entries. Below, we can see that X marks the spot where row one of matrix one and column one of matrix two crash: We know those four numbers need to crunch into one; we also know we read rows left to right, like a book, and we read columns top to bottom. We multiply the first number from the first matrix's first row with the first number from the second matrix's first column (2)(4) = 8, we multiply the second number from the first matrix's row with the second number from the second matrix's column (3)(6) = 18, and we add those together: 26. Next? We rubberneck at the collision between row one of matrix one and column two of matrix two: Right as usual, King Friday. X marks the spot, and we do the same thing. We read rows left to right and we read columns top to bottom. We multiply the first number from the first matrix's first row with the first number from the second matrix's second column (2)(1) = 2, we multiply the second number from the first matrix's first row with the second number from the second matrix's second column (3)(0) = 0, we add those together: 2 + 0 = 2. We're so almost there. X marks the spot, and we do the same thing. We read the row left to right, we read the column top to bottom. This time we are doing the second row in the product, so we multiply the first number from the first matrix's second row with the first number from the second matrix's first column (1)(4) = 4, we multiply the second number from the first matrix's second row with the second number from the second matrix's first column (2)(6) = 12, we add those together: 4 + 12 = 16. We do the same thing one last time, this time with the second row in the first matrix and the second column in the second matrix. (1)(1) = 1, (2)(0) = 0, and 1 + 0 = 1:
Our answer is
