Problem 56220. Easy Sequences 75: Easy as Pisano Pi
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:
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 commentsGroup

Easy Sequences Volume V: Fibonacci Obsession
- 10 Problems
- 1 Finishers
- Cricket - Sort Batters by Distance Run
- Cricket - Average Partnership Contribution
- Cricket - How Much More to Beat Bradman?
- Cricket - Career Batting Statistics
- Cricket - Career Bowling Statistics
- Cricket - Represent Average in "Dulkars" and "Ses"
- Cricket - Peak Batting Average
- Cricket - Report the Result (Part I: Limited Overs)
- Cricket - Most Frequent Bowler-Batter Wicket Combinations
- Cricket - You Miss, I Hit (Rank Bowlers by Proportion of Bowled and LBW Wickets)
- Cricket - Report the Result (Part II: Test Matches)
- Cricket - Is It LBW?
Problem Recent Solvers9
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!