A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
The Multiplicative Persistence Conjecture Is True for Odd Targets
[article]
2021
arXiv
pre-print
In 1973, Neil Sloane published a very short paper introducing an intriguing problem: Pick a decimal integer n and multiply all its digits by each other. Repeat the process until a single digit Δ(n) is obtained. Δ(n) is called the multiplicative digital root of n or the target of n. The number of steps Ξ(n) needed to reach Δ(n), called the multiplicative persistence of n or the height of n is conjectured to always be at most 11. Like many other very simple to state number-theoretic conjectures,
arXiv:2110.04263v1
fatcat:btyexs6zefeftposgww7j2kt4y