Generalized Fibonacci Primitive Roots
N. A. Carella

TL;DR
This paper extends the concept of Fibonacci primitive roots to all integers and provides an asymptotic formula for counting how many integers possess such roots.
Contribution
It introduces a generalization of Fibonacci primitive roots to integers and derives an asymptotic counting formula.
Findings
Derived an asymptotic formula for counting integers with Fibonacci primitive roots.
Generalized Fibonacci primitive roots from primes to all integers.
Provides theoretical foundation for further research in primitive roots.
Abstract
This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Analytic Number Theory Research · Advanced Mathematical Identities
