The powers of a function f: A → A are defined recursively by
Let ƒ1 = f2 = 1, fk = fk−1 + fk−2 for k > 2 be the Fibonacci sequence. Which terms of this sequence are even? Prove your answer.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.