Base case is easy. So assume we know the theorem is true for some n = k. That means

where m is some integer.

We need to show that

is divisible by 9.

To this end, solve the "k" equation for 10^{k+1}

Multiply both sides by 10 so you get that

Plug this into your "k + 1" case.

-Dan