Prove that for all $$n \in \mathbb{N}_0: \ 4^{2n + 1} + 3^{n+2} $$ is divisible by 13.
Base case: $n = 0$ $$4 + 3^2 = 13$$ which is divisible by 13.
We assume it is true for a given $n$. For $n+1$ we have $$4^{2(n+1) + 1} + 3^{(n+1)+2} = 4^{2n + 2 + 1} + 3^{n+1+2} = 4^{2n + 1 +2} + 3^{n+2+1} = 4^{2n + 1}*4^2 + 3^{n+2}*3^1 = $$
What should I do now ?
We write $4^{2n + 3} + 3^{n+2} = 16 (4^{2n+1} )+ 3(3^{n+2}) = 3(4^{2n+1} + 3^{n+2}) + 13(4^{2n+1}) = 0 \bmod 13$
– sku Sep 23 '23 at 20:35