Modulus 10

( 5 + 2 5 ) 999 m o d 10 = ? \large \left \lfloor \left(5+2 \sqrt 5 \right)^{999} \right \rfloor \bmod 10 = ?


The answer is 9.

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

Patrick Corn
Oct 23, 2017

Let a n a_n be defined by the recurrence relation a 0 = 2 , a 1 = 10 , a_0=2,a_1=10, a n = 10 a n 1 5 a n 2 ( n 2 ) . a_n = 10a_{n-1} - 5a_{n-2} \ \ (n \ge 2). Let α = 5 + 2 5 , β = 5 2 5 . \alpha = 5+2\sqrt{5}, \beta = 5-2\sqrt{5}.

Then an easy induction shows that a n = α n + β n , a_n = \alpha^n + \beta^n, and another easy induction on the recurrence relation shows that 10 a n 10|a_n for n 1 n \ge 1 (note that a 2 = 90 a_2 = 90 ).

Note that α n = a n β n = a n + β n . \lfloor \alpha^n \rfloor = \lfloor a_n - \beta^n \rfloor = a_n + \lfloor -\beta^n \rfloor. Now 0 < β < 1 , 0 < \beta < 1, so β n = 1 \lfloor -\beta^n \rfloor = -1 for n 1. n \ge 1.

Putting this all together, we get α 999 = a 999 + β n = a 999 1 9 ( m o d 10 ) . \lfloor \alpha^{999} \rfloor = a_{999} + \lfloor -\beta^n \rfloor = a_{999} - 1 \equiv 9 \pmod{10}.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...