Timeline for For a given value of $n$ and $m$, find $\text{fib}(n)$ $\text{mod } m$ where $n$ is very huge. (Pisano Period)
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 10, 2020 at 7:04 | comment | added | hack3r-0m | your answer doesn't explain why fib(2015) mod 3 = fib(7) mod 3(for m=3 the period is 01120221 and has length 8 and 2015=251∗8+7) | |
| May 10, 2020 at 7:02 | comment | added | Emil Jeřábek | I can read myself, thank you. I am telling you it is more efficient to not compute the period. | |
| May 10, 2020 at 7:00 | history | edited | Emil Jeřábek | CC BY-SA 4.0 |
added 88 characters in body
|
| May 10, 2020 at 7:00 | comment | added | hack3r-0m | Thanks, @Emil, I have computed period and length of period, as question says, how can I find fib(n) mod m using that period? and why fib(2015) mod 3 = fib(7) mod 3(for m=3 the period is 01120221 and has length 8 and 2015=251∗8+7)? | |
| May 10, 2020 at 6:49 | history | answered | Emil Jeřábek | CC BY-SA 4.0 |