Pisano period 
, of an integer n, is the period in which the sequence of Fibonacci numbers modulo n repeats. For example it is not hard to show that 
, 
and 
are 3, 8 and 6, respectively:
, of an integer n, is the period in which the sequence of Fibonacci numbers modulo n repeats. For example it is not hard to show that , and are 3, 8 and 6, respectively:
I have used Pisano period in the solutions of Problem 56050. Easy Sequences 73: Emergence of Fibonacci Insects and Problem 56065. Easy Sequences 74: Fibonacci Bank Account.
In this problem, we are asked to simply output the Pisano period of given integer n.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers10
Suggested Problems
-
30039 Solvers
-
Remove the polynomials that have positive real elements of their roots.
1740 Solvers
-
501 Solvers
-
Find a subset that divides the vector into equal halves
400 Solvers
-
Calculate compression ratio of engine
219 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
