1. Lemma Proof:
We need to prove that for an odd prime p, and for all 0≤n≤2p−1, the following congruence holds:
(n2n)≡(−4)n(n2p−1)(modp)
First, recall the binomial coefficient:
(n2n)=(n!)2(2n)!
We can express the product in the numerator as:
(2n−1)(2n−3)⋯3⋅1
This product can be rewritten modulo p as:
(2n−1)(2n−3)⋯3⋅1≡(−1)n(p−2n+1)(p−2n+3)⋯(p−3)(p−1)(modp)
Simplifying further, we get:
(p−2n+1)(p−2n+3)⋯(p−3)(p−1)=(−2)n(2p−1−n+1)(2p−1−n+2)⋯(2p−1)
Therefore:
(n2n)≡(−1)n⋅4n⋅n!(2p−1−n+1)(2p−1−n+2)⋯(2p−1)≡(−4)n(n2p−1)(modp)
2. Back to the Original Problem:
Given that 2c−1 is divisible by p, we have 2c≡1(modp), which implies c≡21(modp).
3. Using the Lemma:
We need to evaluate:
(−1)2p+1+n=0∑2p−1(n2n)cn
Using the lemma, we substitute (n2n)≡(−4)n(n2p−1)(modp):
n=0∑2p−1(n2n)cn≡n=0∑2p−1(−4)n(n2p−1)(21)n(modp)
Simplifying the expression inside the sum:
(−4)n(21)n=(−2)n
Thus, we have:
n=0∑2p−1(−2)n(n2p−1)
Recognizing this as the binomial expansion of (1−2)2p−1:
n=0∑2p−1(−2)n(n2p−1)=(1−2)2p−1=(−1)2p−1
4. Combining Results:
Therefore, the original expression becomes:
(−1)2p+1+(−1)2p−1
Since 2p+1 and 2p−1 differ by 1, one of them is even and the other is odd. Thus:
(−1)2p+1+(−1)2p−1=0(modp)
The final answer is 0(modp)