The Fibonacci sequence under a modulus: computing all moduli that produce a given period

DOI10.2140/involve.2018.11.769zbMath1430.11023OpenAlexW2798107534WikidataQ130005815 ScholiaQ130005815MaRDI QIDQ1747251

Alex Dishong, Marc S. Renault

Publication date: 4 May 2018

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2018.11.769

zbMATH Keywords

algorithmFibonacci sequenceperiod

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50) Calculation of integer sequences (11Y55)

Related Items (2)

GCD of sums of $k$ consecutive Fibonacci, Lucas, and generalized Fibonacci numbers ⋮ Period sets of linear recurrences over finite fields and related commutative rings

Cites Work

• Splitting Fields and Periods of Fibonacci Sequences Modulo Primes
• Fibonacci Series Modulo m
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Fibonacci sequence under a modulus: computing all moduli that produce a given period