Maths Olympiad Prep

Track / Stage 7 / 145 of 300 #1545 of 1964

Problem 1545

National olympiad second round; IMO P1/P4
Number theory Difficulty 7.2 Prove it

Let pp be an odd prime number and cc an integer for which 2c12c -1 is divisible by pp. Prove that
(1)p+12+n=0p12(2nn)cn(-1)^{\frac{p+1}{2}}+\sum_{n=0}^{\frac{p-1}{2}} {2n \choose n}c^n is divisible by pp.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

1. Lemma Proof:
We need to prove that for an odd prime p p , and for all 0np12 0 \le n \le \frac{p-1}{2} , the following congruence holds:
(2nn)(4)n(p12n)(modp) {2n \choose n} \equiv (-4)^n { \frac{p-1}{2} \choose n} \pmod{p}
First, recall the binomial coefficient:
(2nn)=(2n)!(n!)2 {2n \choose n} = \frac{(2n)!}{(n!)^2}
We can express the product in the numerator as:
(2n1)(2n3)31 (2n-1)(2n-3)\cdots 3 \cdot 1
This product can be rewritten modulo p p as:
(2n1)(2n3)31(1)n(p2n+1)(p2n+3)(p3)(p1)(modp) (2n-1)(2n-3)\cdots 3 \cdot 1 \equiv (-1)^n (p-2n+1)(p-2n+3)\cdots (p-3)(p-1) \pmod{p}
Simplifying further, we get:
(p2n+1)(p2n+3)(p3)(p1)=(2)n(p12n+1)(p12n+2)(p12) (p-2n+1)(p-2n+3)\cdots (p-3)(p-1) = (-2)^n \left( \frac{p-1}{2} - n + 1 \right) \left( \frac{p-1}{2} - n + 2 \right) \cdots \left( \frac{p-1}{2} \right)
Therefore:
(2nn)(1)n4n(p12n+1)(p12n+2)(p12)n!(4)n(p12n)(modp) {2n \choose n} \equiv (-1)^n \cdot 4^n \cdot \frac{\left( \frac{p-1}{2} - n + 1 \right) \left( \frac{p-1}{2} - n + 2 \right) \cdots \left( \frac{p-1}{2} \right)}{n!} \equiv (-4)^n { \frac{p-1}{2} \choose n} \pmod{p}

2. Back to the Original Problem:
Given that 2c1 2c - 1 is divisible by p p , we have 2c1(modp) 2c \equiv 1 \pmod{p} , which implies c12(modp) c \equiv \frac{1}{2} \pmod{p} .

3. Using the Lemma:
We need to evaluate:
(1)p+12+n=0p12(2nn)cn (-1)^{\frac{p+1}{2}} + \sum_{n=0}^{\frac{p-1}{2}} {2n \choose n} c^n
Using the lemma, we substitute (2nn)(4)n(p12n)(modp) {2n \choose n} \equiv (-4)^n { \frac{p-1}{2} \choose n} \pmod{p} :
n=0p12(2nn)cnn=0p12(4)n(p12n)(12)n(modp) \sum_{n=0}^{\frac{p-1}{2}} {2n \choose n} c^n \equiv \sum_{n=0}^{\frac{p-1}{2}} (-4)^n { \frac{p-1}{2} \choose n} \left( \frac{1}{2} \right)^n \pmod{p}
Simplifying the expression inside the sum:
(4)n(12)n=(2)n (-4)^n \left( \frac{1}{2} \right)^n = (-2)^n
Thus, we have:
n=0p12(2)n(p12n) \sum_{n=0}^{\frac{p-1}{2}} (-2)^n { \frac{p-1}{2} \choose n}
Recognizing this as the binomial expansion of (12)p12 (1-2)^{\frac{p-1}{2}} :
n=0p12(2)n(p12n)=(12)p12=(1)p12 \sum_{n=0}^{\frac{p-1}{2}} (-2)^n { \frac{p-1}{2} \choose n} = (1-2)^{\frac{p-1}{2}} = (-1)^{\frac{p-1}{2}}

4. Combining Results:
Therefore, the original expression becomes:
(1)p+12+(1)p12 (-1)^{\frac{p+1}{2}} + (-1)^{\frac{p-1}{2}}
Since p+12 \frac{p+1}{2} and p12 \frac{p-1}{2} differ by 1, one of them is even and the other is odd. Thus:
(1)p+12+(1)p12=0(modp) (-1)^{\frac{p+1}{2}} + (-1)^{\frac{p-1}{2}} = 0 \pmod{p}

The final answer is 0(modp) \boxed{ 0 \pmod{p} }

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.