TL;DR
This paper introduces a computational approach to determine the cycle length of Fibonacci sequences modulo m and p, aiding understanding of their periodic properties in modular arithmetic.
Contribution
It presents a new method for efficiently computing the period length of Fibonacci sequences modulo arbitrary integers and primes.
Findings
The method accurately computes Fibonacci cycle lengths for various moduli.
It reveals patterns in Fibonacci periodicity related to the properties of m and p.
The approach improves computational efficiency over previous techniques.
Abstract
This paper proposes a computational method for obtaining the length of the cycle that arises from the Fibonacci series taken mod m (some number) and mod p (some prime number).
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 · Mathematics and Applications · Advanced Mathematical Theories