The powers of a function f: A → A are defined recursively by
[BB] Suppose we think of the Fibonacci sequence as going backward as well as forward. What seven terms precede 1. 1. 2. 3. 5. 8. …? How is f−n related to ƒn?
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.