Checking that statement is true for n=1.
Let P(n):(AB)n=AnBn
For n=1
P(1):(AB)1=A1B1
⇒AB=AB
∴P(1) is true.
Assume P(n) be true for n=k.
(Where k∈N)
So, P(k):(AB)k=AkBk,k∈N ... (1)
Proving for n=k+1
i.e. to prove P(k+1):(AB)k+1=Ak+1Bk+1
(AB)k+1=(AB)k(AB)
⇒(AB)k+1=AkBk(AB)
⇒(AB)k+1=AkBk−1B(AB)
⇒(AB)k+1=AkBk−1ABB [∵AB=BA]
⇒(AB)k+1=AkBk−1AB2
Repeating same step, we get
⇒(AB)k+1=AkBk−1AB3
Following this several times , we get
⇒(AB)k+1=Ak+1Bk+1
∴P(k+1) is true.
So P(n) is true for all n∈N.
Hence (AB)n=AnBn, for all n∈N