For n=0
, which is a multiple of 13.
Base case: n = 0:
OK.
Assume that holds true for n = k.
is divisible by 13.
Prove that it holds true for n = k + 1:
In this final sum, the first addend is obviously divisible by 13, and since what's inside the parentheses is divisible by 13, so is the second addend. Thus the final sum is divisible by 13.
01