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.
Let a n be defined by the recurrence relation a 0 = 2 , a 1 = 1 0 , a n = 1 0 a n − 1 − 5 a n − 2 ( n ≥ 2 ) . Let α = 5 + 2 5 , β = 5 − 2 5 .
Then an easy induction shows that a n = α n + β n , and another easy induction on the recurrence relation shows that 1 0 ∣ a n for n ≥ 1 (note that a 2 = 9 0 ).
Note that ⌊ α n ⌋ = ⌊ a n − β n ⌋ = a n + ⌊ − β n ⌋ . Now 0 < β < 1 , so ⌊ − β n ⌋ = − 1 for n ≥ 1 .
Putting this all together, we get ⌊ α 9 9 9 ⌋ = a 9 9 9 + ⌊ − β n ⌋ = a 9 9 9 − 1 ≡ 9 ( m o d 1 0 ) .