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

This is my first question here so please go easy on me.

If you add the digits of each number on the Fibonacci sequence until your number is less than 10, it seems that you get a pattern of 24 numbers which is:

1 2 3 5 8 4 3 7 1 8 9 8 8 7 6 4 1 5 6 2 8 1 9 1

Of course, I didn't prove that, I just used Python to calculate the first 10000 numbers so I believe that the statement may be true.

My questions are many...

  • Is there a logic explanation about this?
  • Why 24 numbers?
  • Can it be proved that this statement is true?
  • Is 10 the only number that can produce this?

Thank you.

share|cite|improve this question
up vote 9 down vote accepted

The procedure you describe, applied to $n$, finishes with the remainder of $n$ when divided by $9$. As the remainder behaves well with respect to the sum ( $r_9(r_9(a)+r_9(b))=r_9(a+b)$) you can work always with remainders. It is easy to see that two consecutive terms determine the whole sequence and there are a finite number of possible pairs, so that the sequence has to become periodic.

This can be explained easily using modular arithmetic and, in particular, your problem is a well-known one. See this article.

share|cite|improve this answer
More precisely, you don't obtain the remainder if $n>0$ is a multiple of $9$, inwhich case you obtain $9$ instead of $0$. But that doesn't destroy the (eventual) periodicity. – Hagen von Eitzen Feb 6 '14 at 18:49

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.