Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have made some observation on very interesting material on Fibonacci series. I need some help in proving them mathematically.

We can observe that the periodicity of Fibonacci numbers modulo m, which non-trivial. Can we prove this mathematically? Also, how we can prove this period is always an even and the period itself modulo m is less than or equal to m2−1. How we prove this one. Also, justify mathematically the period modulo m is less than or equal to 6m, and other interesting facts about the period modulo a prime number.

Thank you so much for this wonderful platform.

share|cite|improve this question

Each term depends only on the two preceding. Modulo $m$, there are only $m^2$ possibilities for the two preceding, so after at most $m^2$ terms there must be a repeat of two consecutive terms, and from there on it must repeat forever.

We can sharpen $m^2$ to $m^2-1$ by noting that if two consecutive terms were 0 modulo $m$ then all terms would be zero modulo $m$.

See also Fibonacci modular results and Fibonacci modular results 2

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.