We're on induction right now. Can somebody help me?
Prove that for all integers n, 3^(3n+1) + 2^(n+1) is a multiple of 5.
= Remainder of
We'll prove that for all integers.
Firstly, try it for an integer, for example ..
Now we can use induction.
So if f(n) is divisible, f(n+1) is divisible too.
Note: This doesn't work for all n integers. It works for