Extending 1089 attractor to any number of digits and any number of steps
Yannis Almirantis, Wentian Li

TL;DR
This paper generalizes the 1089 number trick to any number of digits and steps, revealing new dynamical patterns, cycles, and properties of integers through iterative digital reversal processes.
Contribution
It introduces a generalized iterative digital reversal system and characterizes new cycles, diverging behaviors, and the structure of resulting integers beyond the classical 1089 trick.
Findings
Identification of 2-cycles and higher p-cycles in the system.
Discovery of diverging trajectories with 8-cycle rhythm signatures.
Characterization of Papadakis-Webster integers and binary strings.
Abstract
The well-known 1089 trick reflects an amazing trait of digital reversal process and reminisces of a limiting attractor in dynamical systems even though it takes only two steps. It is natural to consider the situations when the number of digits is beyond three as in the original 1089 trick, as well as situations when the number of steps is beyond two. The first part has been mostly done by Webster which we will reproduce. After two steps, the resulting integers are called Papadakis-Webster integers (PWI), which is always divisible by 99, and the resulting quotients consist of only 0's and 1's, which we name Papadakis-Webster binary strings (PWBS). Not all binary strings could be PWBS, and we define the hairpin pairing rule to determine if a binary string is a PWBS. For the second part, we propose a two-option iteration system named iterative digital reversal (IDR) suitably interweaving…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
