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 Solvers12
Suggested Problems
-
5172 Solvers
-
423 Solvers
-
Flip the main diagonal of a matrix
927 Solvers
-
Implement a bubble sort technique and output the number of swaps required
404 Solvers
-
Find two triangular numbers whose sum is input.
103 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!
