Join Nostr
2026-09-19 16:14:54 UTC
in reply to

YODL on Nostr: Another one. This time not employing the ascending and descending thing. Algorithm: ...

Another one. This time not employing the ascending and descending thing.
Algorithm: f(n) = |n − reverse(n)| + 8, treating n as 4 digits with leading zeros.
- Every input converges to 8000. There are no other cycles, and no input ever exceeds 9999, so no mod is needed.
- Fixed point: 8000. Check: reverse(8000) = 0008, so 8000 − 8 = 7992, and 7992 + 8 = 8000.
- The worst case is 37 steps, starting from 0017