Proof

Proof by induction

Show a statement is true for $n=1$, then show that if it is true for $n=k$ it must be true for $n=k+1$. Together these prove it for every positive integer, like an endless line of falling dominoes.