Partial sum
Number Theory
Level
4
The partial sums of the first n and n + 1 numbers of the Fibonacci sequence are both divisible by 11. What is the smallest value of n for which this is true?
The answer is 10.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!