Skip to content
Question of 182

Q.If A = [[0, 6, 7], [-6, 0, 8], [7, -8, 0]], B = [[0, 1, 1], [1, 0, 2], [1, 2, 0]], C = [[2], [-2], [3]]; Verify that A(B+C) = AB + AC.

Uttarakhand UbseUttarakhand Board Intermediate (Class 12) 2026Subjective· 4mImportance★★★★★
0% · 0/182 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

With BB a 3×33\times3 matrix and CC a 3×13\times1 column, B+CB+C is not defined, so the printed identity A(B+C)=AB+ACA(B+C)=AB+AC cannot be formed. The consistent (NCERT) version is (A+B)C=AC+BC(A+B)C=AC+BC; both sides come out to [102028]\begin{bmatrix}10\\20\\28\end{bmatrix}, verifying the distributive law.

[!NOTE]

Two matrices can be added only when they have the same order. Here BB is 3×33\times3 and CC is 3×13\times1, so B+CB+C does not exist and the expression A(B+C)A(B+C) is meaningless as printed. The well-known NCERT problem using exactly these matrices asks to verify the distributive law (A+B)C=AC+BC(A+B)C=AC+BC (here A+BA+B is 3×33\times3 and CC is 3×13\times1, so every product is defined). We solve that valid version below.

Concept. Matrix multiplication distributes over addition: (A+B)C=AC+BC(A+B)C=AC+BC. Row ×\times column multiplication: entry == sum of products of corresponding row and column elements.

Given. A=[067−6087−80], B=[011102120], C=[2−23].A=\begin{bmatrix}0&6&7\\-6&0&8\\7&-8&0\end{bmatrix},\ B=\begin{bmatrix}0&1&1\\1&0&2\\1&2&0\end{bmatrix},\ C=\begin{bmatrix}2\\-2\\3\end{bmatrix}.

LHS: (A+B)C(A+B)C.

  • A+B=[078−50108−60]A+B=\begin{bmatrix}0&7&8\\-5&0&10\\8&-6&0\end{bmatrix}.
  • (A+B)C=[0(2)+7(−2)+8(3)−5(2)+0(−2)+10(3)8(2)+(−6)(−2)+0(3)]=[−14+24−10+3016+12]=[102028](A+B)C=\begin{bmatrix}0(2)+7(-2)+8(3)\\-5(2)+0(-2)+10(3)\\8(2)+(-6)(-2)+0(3)\end{bmatrix}=\begin{bmatrix}-14+24\\-10+30\\16+12\end{bmatrix}=\begin{bmatrix}10\\20\\28\end{bmatrix}.

RHS: AC+BCAC+BC. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.