The correct option is
A AN+1=BN(B+(N+1)C)Solution - we will prove this solution by induction
and check by A options.
given B,C are square matrix of order n and if
A=B+C,BC=CB,C2=0
(i)An+1=BN(B+(N+1)C)
For n=1, we have
A2=B(B+2C)...(1)
and given A=B+C
So, A2=(B+C)(B+C)=B2+BC+CB+C2
A2=B2+2BC (∵BC=CB&C2=0)
A2=B(B+2C)
So, the statement is true for n=1
Assume that the statement is true for n=k
∴Ak+1=Bk(B+(k+1)C)
we shall now show that it is true for
n=k+1
That is we need to show that
Ak+2=Bk+1(B+(K+2)C)
Now, Ak+2=Ak+1.A
=(Bk(B+(k+1)C))(B+C) [using induction hypothesis]
=(Bk+1+(k+1)BkC)(B+C)
=Bk+1(B+C)+(K+1)Bkc(B+C)
=Bk+2+Bk+1C+(k+1)BkCB+(k+1)BkC2
=Bk+2+Bk+1C+(k+1)BkBC [∵C2=0&BC=CB]
=Bk+2+Bk+1C+(k+1)Bk+1C
=Bk+2+(k+2)Bk+1C
Ak+2=Bk+1(B+(K+2)C)
H.P
So, option (A) is correct
and option (B),(C) and (D) is Discard (Clearly)
because option (B),(C) and (D) is not
true for n=1