Define the sequence recursively as follows: , , and for , be the remainder of when divided by .
What is the value of
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.
F k = { 1 , 1 , 2 , 0 , 2 , 2 , 1 , 0 , 1 , 1 , . . . . . . . . }
we can see that
F k = ⎩ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎧ 1 1 2 0 2 2 1 0 k = 8 n k = 8 n + 1 k = 8 n + 2 k = 8 n + 3 k = 8 n + 4 k = 8 n + 5 k = 8 n + 6 k = 8 n + 7
so ∑ k = 0 8 F k = 9 ⇒ ∑ k = 0 8 n F k = 9 n
∑ k = 2 0 1 7 2 0 2 4 F k = ∑ k = 0 2 0 2 4 F k − ∑ k = 0 2 0 1 6 F k
= ∑ k = 0 8 ⋅ 2 5 3 F k − ∑ k = 0 8 ⋅ 2 5 2 F k = 9 × 2 5 3 − 9 × 2 5 2 = 9