An n-cycle for a function f(x)
is a collection of n numbers,
x_{1}, x_{2}, ..., x_{n} related in this way | |||||

| |||||

The reason for calling this a cycle should be clear: iteration takes
us from x_{1} to x_{2}, from x_{2} to x_{3}, _{n} back to x_{1}. | |||||

| |||||

Here is an application of counting cycles to a
problem in number theory. |

Return to Deterministic Chaos.