A sequence { T ( n ) } n ≥ 1 having first term T ( 1 ) = 1 has subsequent terms defined by the following recurrence relation,
T ( n ) T ( n + 1 ) = 4 7 + ( − 1 ) n − 1 ∀ n ≥ 1
What is the units' digit of the sum of the first 2014 terms of the above defined sequence ?
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.
T ( n ) T ( n + 1 ) ⇒ T ( n + 1 ) ⇒ T ( 1 ) T ( 2 ) T ( 3 ) T ( 4 ) T ( 5 ) T ( 6 ) T ( 7 ) T ( 8 ) T ( 9 ) = 4 7 + ( − 1 ) n − 1 = 4 7 + ( − 1 ) n − 1 T ( n ) = 1 = 4 7 + ( − 1 ) 0 T ( 1 ) = 2 ( 1 ) = 2 = 4 7 + ( − 1 ) 1 T ( 2 ) = 4 6 ( 2 ) = 3 = 2 ( 3 ) = 6 = 2 3 ( 6 ) = 9 = 1 8 = 2 7 = 5 4 = 8 1
Let the sum of the 2014 terms be S , then we have:
S = n = 1 ∑ 2 0 1 4 T ( n ) = 1 + 2 + 3 + 6 + 9 + 1 8 + 2 7 + 5 4 + 8 1 + 1 6 2 + . . . + 3 1 0 0 6 + 2 ( 3 1 0 0 6 ) = 3 ( 1 ) + 3 ( 3 ) + 3 ( 9 ) + 3 ( 2 7 ) + 3 ( 8 1 ) + . . . + 3 ( 3 1 0 0 6 ) = 3 ( 1 + 9 ) + 3 ( 3 + 2 7 ) + 3 ( 8 1 + 7 2 9 ) + . . . + 3 ( 3 1 0 0 4 + 3 1 0 0 6 ) + 3 ( 3 1 0 0 5 ) = 3 ( 1 0 ) + 3 ( 4 0 ) + 3 ( 8 1 0 ) + . . . + 3 ( 1 0 ) ( 3 1 0 0 4 ) + 3 ( 3 1 0 0 5 )
⇒ S ≡ 3 1 0 0 6 ( m o d 1 0 ) Since 3 and 10 are coprimes, by Euler’s Totient Theorem: 3 ϕ 1 0 ≡ 3 4 ≡ 1 ( m o d 1 0 ) ≡ 3 4 × 2 5 1 + 2 ( m o d 1 0 ) ≡ 9 ( m o d 1 0 )
Problem Loading...
Note Loading...
Set Loading...
Okay, so looking at the function, we have the following:
T ( n + 1 ) = T ( n ) ( 4 7 + ( − 1 ) n − 1 )
Which means that if n is odd, then we have T(n+1)=2T(n) and if n is even, T(n+1)=3/2T(n). We compute the first and last few terms:
1 , 2 , 3 , 6 , 9 , 1 8 , 2 7 , 5 4 , . . . 3 1 0 0 6 , 2 ⋅ 3 1 0 0 6
So if we want to find the units digit we pair the numbers as the following:
1 + 2 + 3 + 6 + 9 + 1 8 + . . . 3 1 0 0 6 + 2 ⋅ 3 1 0 0 6 = ( 1 + 3 + 9 + 2 7 + . . . + 3 1 0 0 6 ) + ( 2 + 6 + 1 8 + 5 4 + . . . + 2 ⋅ 3 1 0 0 6 ) = 3 ( 1 + 3 + 9 + 2 7 + 8 1 + . . . + 3 2 0 0 6 ) = 3 + 9 + 2 7 + 8 1 + 2 4 3 + . . . + 3 1 0 0 7
So we want to find the units digit of this sum. Notice that the units digit of powers of 3 occurs in a pattern: 3,9,7,1,3,9,7,1... and so on. Notice 3+9+7+1=20 which means, if we group by 4s, each group of 4's units digit is 0, therefore not having an overall effect on the sum's units digit. To see what I mean, because I know I make no sense sometimes, see the following:
3 + 9 + 2 7 + 8 1 + 2 4 3 + . . . + 3 1 0 0 7 ≡ ( 3 + 9 + 7 + 1 ) + ( 3 + 9 + 7 + 1 ) + . . . + ( 3 + 9 + 7 + 1 ) + 3 + 9 + 7 ≡ 2 0 + 2 0 + 2 0 + . . . + 2 0 + 1 9 ≡ 1 9 ≡ 9 m o d ( 1 0 )