An n-cycle for a function f(x) is a collection of n numbers, x1, x2, ..., xn related in this way | |||||
| |||||
The reason for calling this a cycle should be clear: iteration takes
us from x1 to x2, from x2 to x3, | |||||
| |||||
Here is an application of counting cycles to a problem in number theory. |
Return to Deterministic Chaos.