2000 character limit reached
On the Erdős-Sloane and Shifted Sloane Persistence Problems
Published 2 Sep 2020 in math.NT | (2009.01114v4)
Abstract: In this paper, we investigate two variations on the so-called persistence problem of Sloane: the shifted version, which was introduced by Wagstaff; and the nonzero version, proposed by Erd\H{o}s. We explore connections between these problems and a recent conjecture of de Faria and Tresser regarding equidistribution of the digits of some integer sequences and some of its natural generalizations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.