Suppose that $a_0, a_1, a_2, \dots$ is a sequence defined as follows. $$a_0 = 2, a_1 = 4, a_2 = 6 \text{, and } a_k = 7 a_{k-3} \text{ for all integers $k \ge 3$.}$$ Prove that $a_n$ is even for all integers $n \ge 0$.
Asked
Active
Viewed 213 times
0
-
What are your thoughts on the problem? – kingW3 Oct 20 '15 at 21:49
-
Well I have no idea how to prove it, I know how to prove the base case and write the inductive step but not applying inductive hypothesis and proving it's even! – isharailanga Oct 20 '15 at 21:55
1 Answers
0
Except the basic case is trivial and assuming that the statement holds for each $k \leq n - 1$ you have $a_n = 7a_{n-3} $. By hypothesis $a_{k-3} = 2\gamma$, $\gamma$ integer, so $a_n = 14 \gamma$ which implies that 2 divides $a_n $.
user8469759
- 5,285
-
what about 'k+1'th term of a?How can we prove it's also divisible!Or Do I really have to prove that too :( – isharailanga Oct 20 '15 at 22:36
-
I made a mistake, the induction is basic case and assuming that it holds up to n -1 then we prove the case n. Now since it is true up to n you could verify n + 1... but you don't need to do that because of the induction you just proved. About the divisibility... an integer is even if it is the product of 2 times another integer, and such property assuming it holds up to n -1 also hold to n as we proved. – user8469759 Oct 20 '15 at 23:23