Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.