Middle elements of Pascal's Triangle

f ( n ) = k = 0 n ( 2 n 2 k n k ) ( 2 k k ) \large f(n) = \sum_{k=0}^n{\binom{2n-2k}{n-k}\binom{2k}{k}}

For f ( n ) f(n) as defined above, find f ( 2017 ) m o d 10 f(2017) \bmod{10} .


The answer is 4.

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.

2 solutions

Mark Hennings
May 24, 2017

Since 1 1 4 x = n = 0 ( 2 n n ) x n x < 1 4 \frac{1}{\sqrt{1-4x}} \; = \; \sum_{n=0}^\infty {2n \choose n}x^n \hspace{2cm} |x| < \tfrac14 we deduce that n = 0 f ( n ) x n = ( n = 0 ( 2 n n ) x n ) 2 = 1 1 4 x x < 1 4 \sum_{n=0}^\infty f(n)x^n \; = \; \left(\sum_{n=0}^\infty {2n \choose n}x^n\right)^2 \; = \; \frac{1}{1-4x} \hspace{2cm} |x| < \tfrac14 and hence it follows that f ( n ) = 4 n f(n) = 4^n for all n 0 n \ge 0 . Since 4 1 ( m o d 5 ) 4 \equiv -1 \pmod{5} it is clear that f ( 2017 ) = 4 2017 4 ( m o d 5 ) f(2017) = 4^{2017} \equiv \boxed{4} \pmod{5} .

Is my solution correct @Mark Hennings

Md Zuhair - 4 years ago

Log in to reply

I am afraid not.

Mark Hennings - 4 years ago

Wow, that solution is amazing

Prateek Saini - 3 years, 10 months ago
Kartik Sharma
May 24, 2017

Claim: ( 2 r r ) = ( 4 ) r ( 1 / 2 r ) \displaystyle \text{Claim:} \binom{2r}{r} = {(-4)}^r \binom{-1/2}{r}

The proof is left as an exercise to the reader but it is advised to learn it after you have proved it.

( 2 k k ) = ( 4 ) k ( 1 / 2 k ) \displaystyle \binom{2k}{k} = {(-4)}^k \binom{-1/2}{k}

( 2 n 2 k n k ) = ( 4 ) n k ( 1 / 2 n k ) \displaystyle \binom{2n-2k}{n-k} = {(-4)}^{n-k} \binom{-1/2}{n-k}

( 2 k k ) ( 2 n 2 k n k ) = ( 4 ) n ( 1 / 2 k ) ( 1 / 2 n k ) \displaystyle \binom{2k}{k} \binom{2n-2k}{n-k} = {(-4)}^n \binom{-1/2}{k} \binom{-1/2}{n-k}

k = 0 n ( 2 k k ) ( 2 n 2 k n k ) = k = 0 n ( 4 ) n ( 1 / 2 k ) ( 1 / 2 n k ) \displaystyle \sum_{k=0}^n{\binom{2k}{k} \binom{2n-2k}{n-k}} = \sum_{k=0}^n{{(-4)}^n \binom{-1/2}{k} \binom{-1/2}{n-k}}

Now we can use Vandermonde's convolution,

= ( 4 ) n k = 0 n ( 1 / 2 k ) ( 1 / 2 n k ) = ( 4 ) n ( 1 n ) = 4 n \displaystyle = {(-4)}^n \sum_{k=0}^n{\binom{-1/2}{k}\binom{-1/2}{n-k}} = {(-4)}^n \binom{-1}{n} = 4^n

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...