Abstract
We examine the persistence of a number, defined as the number of iterations of the function which multiplies the digits of a number until one reaches a single digit number. We give numerical evidence supporting Sloane’s 1973 conjecture that there exists a maximum persistence for every base. In particular, we give evidence that the maximum persistence in each base 2 through 12 is 1, 3, 3, 6, 5, 8, 6, 7, 11, 13, 7, respectively.
Citation
Stephanie Perez. Robert Styer. "Persistence: a digit problem." Involve 8 (3) 439 - 446, 2015. https://doi.org/10.2140/involve.2015.8.439
Information
