I have been scouring for resources that i can understand, which prove that the first fibonacci number divisible by K can be found in O(K) time, but I couldnt. Can someone provide a satisfactory proof for that?
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | Um_nik | 162 |
3 | maomao90 | 161 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
5 | -is-this-fft- | 158 |
7 | adamant | 154 |
7 | Dominater069 | 154 |
9 | awoo | 152 |
9 | luogu_official | 152 |
I have been scouring for resources that i can understand, which prove that the first fibonacci number divisible by K can be found in O(K) time, but I couldnt. Can someone provide a satisfactory proof for that?
Name |
---|
Pisano periods might help
For Pisano periods, the upper bound is given by P(k) ≤ k*k−1. However, we are primarily concerned with the first occurrence of 0 in F(n)modk and the repetition of the entire sequence (where F(n) is the n-th Fibonacci number). Therefore, I couldn't infer much from it.
There are at most 4 zeros in the Pisano period, so it only changes by a constant factor, and since the 0s repeat they can't be dense in the first quarter of the period or something like that, so they are equivalent (not sure though, might be wrong)
P(k) <= 6k, maybe you should read those sources you scoured for more carefully
where i can get this proof that p(k)<=6k
.