Find the remainder, when is divided by , given that and that .
Note that is a prime.
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.
If we define X n = x n + x − n , then X 0 = 2 , X 1 = 2 0 1 9 and X n + 1 + X n − 1 = ( x + x − 1 ) X n = 2 0 1 9 X n n ≥ 1 It is clear that X n is therefore an integer for each n ≥ 0 , and it is easy to calculate the remainder of X n modulo 1 0 0 0 0 0 0 0 0 7 using this recurrence relation. Since C = X 2 0 1 9 we obtain the answer 7 6 4 1 2 3 2 2 0 .