When Does 2027 Divide This Binomial Expression?

Find the smallest positive integer k k for which n = 0 1013 ( 2 n n ) k n \sum^{1013}_{n=0}{2n \choose n} k^n is divisible by the prime 2027.


The answer is 507.

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

Calvin Lin Staff
Mar 30, 2014

Hint: Evaluate ( 2 n n ) ( m o d 2027 ) { 2n \choose n } \pmod{2027} , into a form such that you can manipulate the expression using the Binomial Theorem. Namely, ( 2 n n ) α n ( β n ) { 2n \choose n } \equiv \alpha ^n { \beta \choose n} for some fixed α , β \alpha, \beta .

Hint: Using the Binomial Theorem, show that n = 0 1013 ( 2 n n ) k n a b ( m o d 2027 ) \sum_{n=0}^{1013} {2n \choose n } k^n \equiv a^b \pmod{2027} for some a a and b b .

What do these hints suggest about the values of β \beta and b b ?

What is a a in terms of α \alpha ?

What does Emmanuel's solution suggest about the value of α \alpha ?

Hence show that 2027 a 2027 \mid a , which you can use to determine the smallest value of k k .


Another solution:

Recall that 1 1 4 x = i = 0 ( 2 i i ) x i \displaystyle \frac{ 1} { \sqrt{1-4x} } = \sum_{i=0}^{\infty} { 2i \choose i } x^i

How do we relate this to the expression in the problem?

As I was feeling too stupid to do it analytically, I threw the question at Sage which provided the answer in a matter of a few seconds.

Alasdair McAndrew - 7 years, 2 months ago
Emmanuel Lasker
Mar 20, 2014

The answer is 2027 + 1 4 = 507 \frac{2027+1}{4}=507 , I found it by checking the trivial cases 3 , 7 , 11 3,7,11 , so I have no proof of this fact, I was only lucky...

Given that: j = 0 n ( 2 j j ) ( 2 n 2 j n j ) = 4 n \sum_{j=0}^n \binom{2j}{j}\binom{2n-2j}{n-j}=4^n due to the Vandermonde convolution of central binomial coefficients, and: n [ 1014 , 2026 ] , ( 2 n n ) 0 ( m o d 2027 ) , \forall n\in[1014,2026],\quad \binom{2n}{n}\equiv 0\pmod{2027}, we have: ( j = 0 1013 ( 2 j j ) k j ) 2 j = 0 2026 ( 4 k ) j ( m o d 2027 ) . \left( \sum_{j=0}^{1013}\binom{2j}{j}k^j\right)^2 \equiv \sum_{j=0}^{2026}(4k)^j \pmod{2027}. If 4 k 1 ( m o d 2027 ) 4k\equiv 1\pmod{2027} the last sum is zero ( m o d 2027 ) \pmod{2027} , otherwise it is one ( m o d 2027 ) \pmod{2027} , since: j = 0 2026 ( 4 k ) j = ( 4 k ) 2027 1 4 k 1 4 k 1 4 k 1 1 ( m o d 2027 ) , \sum_{j=0}^{2026}(4k)^j=\frac{(4k)^{2027}-1}{4k-1}\equiv \frac{4k-1}{4k-1}\equiv 1\pmod{2027}, due to a p a ( m o d p ) a^p\equiv a\pmod{p} . This gives that in order to have the initial sum equal to zero, we must have 4 k 1 ( m o d 2027 ) 4k\equiv 1\pmod{2027} , id est k 507 ( m o d 2027 ) k\equiv 507\pmod{2027} .

Jack D'Aurizio - 7 years, 2 months ago

Log in to reply

A slightly more direct approach which uses the ideas that you presented here, is to show that

( 2 n n ) ( 4 ) n ( 1013 n ) ( m o d 2027 ) { 2n \choose n } \equiv (-4)^n { 1013 \choose n } \pmod{2027}

Hence,

n = 0 1013 ( 2 n n ) k n = n = 0 1013 ( 1013 n ) ( 4 k ) n = ( 1 4 k ) 1013 ( m o d 2027 ) \sum_{n=0}^{1013} {2n \choose n} k^n = \sum_{n=0}^{1013} {1013 \choose n} (-4k)^n = (1-4k)^{1013} \pmod{2027}

Hence, we must have 1 4 k 0 ( m o d 2027 ) 1-4k \equiv 0 \pmod{2027} .

Calvin Lin Staff - 7 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...