PolyRing

Find the remainder, when C C is divided by 1000000007 1000000007 , given that x 2 2019 x + 1 = 0 x^2 - 2019x + 1 = 0 and that x 4038 C x 2019 + 1 = 0 x^{4038} - Cx^{2019} + 1 = 0 .

Note that 1000000007 1000000007 is a prime.


The answer is 764123220.

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.

1 solution

Mark Hennings
Feb 15, 2019

If we define X n = x n + x n X_n = x^n + x^{-n} , then X 0 = 2 X_0=2 , X 1 = 2019 X_1 = 2019 and X n + 1 + X n 1 = ( x + x 1 ) X n = 2019 X n n 1 X_{n+1} + X_{n-1} \; = \; (x + x^{-1})X_n \; = \; 2019X_n \hspace{2cm} n \ge 1 It is clear that X n X_n is therefore an integer for each n 0 n \ge 0 , and it is easy to calculate the remainder of X n X_n modulo 1000000007 1000000007 using this recurrence relation. Since C = X 2019 C = X_{2019} we obtain the answer 764123220 \boxed{764123220} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...