2000 character limit reached
On Zeckendorf-Niven numbers and arithmetic progressions
Published 22 Jun 2026 in math.NT | (2606.24006v1)
Abstract: A positive integer is Zeckendorf-Niven (respectively, Lucas-Niven) if it is divisible by the number of summands in its Zeckendorf decomposition (respectively, Lucas decomposition). We show that there exist infinitely many Zeckendorf-Niven numbers and Lucas-Niven numbers in every arithmetic progression. Furthermore, we provide bounds on the maximum number of consecutive Zeckendorf-Niven terms in certain arithmetic progressions.
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.