3 ms·
Because f(n) = log(n) eventually grows arbitrarily slower then f(n) = n, no matter what the base of that logarithm is, you can generalize that to arbitrary numb
by Someone 9y ago
Because f(n) = log(n) eventually grows arbitrarily slower then f(n) = n, no matter what the base of that logarithm is, you can generalize that to arbitrary number base b > 2 and arbitrary powers p > 2, and show that any starting number will eventually reach a cycle.
Now, one can ask question such as:
- for which (number base, power) pairs is that cycle unique?
- for which (number base, power) pairs is that cycle shortest? (For example, 153 = 1³ + 5³ + 3³, so if (base 10, power 3) has only one such cycle, it has length 1. Similarly, 4150 = 4^⁵ + 1^⁵ + 5^⁵ + 0^⁵ could be the unique cycle of length 1 for base 10, power 5.
- what does the function f(base, power) look like?