To prove that the Fibonacci sequence is periodic modulo m for all positive integers m.

293 Views Asked by At

So in order to prove this I am asked to first start off by proving fa ≡ fb(mod m) and fa+1 ≡fb+1 (mod m). The question doesn't specify much. I have an idea on how to prove that the residues are periodic, but I'm not sure how to prove that if we take fa (mod m) we will get a Fibonacci number fb.