Zeckendorf representation of multiplicative inverses modulo a Fibonacci number
Gessica Alecci, Nadir Murru, Carlo Sanna

TL;DR
This paper extends the Zeckendorf representation of multiplicative inverses modulo Fibonacci numbers from the case of 2 to any fixed integer a ≥ 3, using base-φ expansion techniques.
Contribution
It generalizes the Zeckendorf representation of inverses modulo Fibonacci numbers for any fixed a ≥ 3, beyond the previously studied case of 2.
Findings
Zeckendorf representations are determined for a ≥ 3.
Results apply to all n with gcd(a, F_n) = 1.
Proof utilizes base-φ expansion of real numbers.
Abstract
Prempreesuk, Noppakaew, and Pongsriiam determined the Zeckendorf representation of the multiplicative inverse of modulo , for every positive integer not divisible by , where denotes the th Fibonacci number. We determine the Zeckendorf representation of the multiplicative inverse of modulo , for every fixed integer and for all positive integers with . Our proof makes use of the so-called base- expansion of real numbers.
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
TopicsComputability, Logic, AI Algorithms · Advanced Mathematical Theories and Applications · semigroups and automata theory
