Prove by induction: that for every positive integer n, 4^n +14 is congruent to 0 (mod 6).
You do realize that means is divisible by six for each n?
Clearly it is true for . No?
Suppose that it is true for now prove it is true for .
Look at this .
Is that a multiple of six?