For n≥0n \ge 0n≥0 define matrices AnA_nAn and BnB_nBn as follows: A0=B0=(1)A_0 = B_0 = (1)A0=B0=(1) and for every n>0n > 0n>0
Denote the sum of all elements of a matrix MMM by S(M)S(M)S(M). Prove that S(Ank−1)=S(Akn−1)S(A_n^{k-1}) = S(A_k^{n-1})S(Ank−1)=S(Akn−1) for every n,k≥1n, k \ge 1n,k≥1.
Hidden so you can work on the problem first.