f ( n ) = k = 0 ∑ n ( n − k 2 n − 2 k ) ( k 2 k )
For f ( n ) as defined above, find f ( 2 0 1 7 ) m o d 1 0 .
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.
Is my solution correct @Mark Hennings
Wow, that solution is amazing
Claim: ( r 2 r ) = ( − 4 ) r ( r − 1 / 2 )
The proof is left as an exercise to the reader but it is advised to learn it after you have proved it.
( k 2 k ) = ( − 4 ) k ( k − 1 / 2 )
( n − k 2 n − 2 k ) = ( − 4 ) n − k ( n − k − 1 / 2 )
( k 2 k ) ( n − k 2 n − 2 k ) = ( − 4 ) n ( k − 1 / 2 ) ( n − k − 1 / 2 )
k = 0 ∑ n ( k 2 k ) ( n − k 2 n − 2 k ) = k = 0 ∑ n ( − 4 ) n ( k − 1 / 2 ) ( n − k − 1 / 2 )
Now we can use Vandermonde's convolution,
= ( − 4 ) n k = 0 ∑ n ( k − 1 / 2 ) ( n − k − 1 / 2 ) = ( − 4 ) n ( n − 1 ) = 4 n
Problem Loading...
Note Loading...
Set Loading...
Since 1 − 4 x 1 = n = 0 ∑ ∞ ( n 2 n ) x n ∣ x ∣ < 4 1 we deduce that n = 0 ∑ ∞ f ( n ) x n = ( n = 0 ∑ ∞ ( n 2 n ) x n ) 2 = 1 − 4 x 1 ∣ x ∣ < 4 1 and hence it follows that f ( n ) = 4 n for all n ≥ 0 . Since 4 ≡ − 1 ( m o d 5 ) it is clear that f ( 2 0 1 7 ) = 4 2 0 1 7 ≡ 4 ( m o d 5 ) .