Maths Olympiad Prep

Library / /73 of 397

Number theory Difficulty 5.1 AIME, harder Prove it Taiwan

Let p=8k+1p = 8k + 1 be a prime and kk a positive integer. Let rr be the remainder when (4kk)\binom{4k}{k} is divided by pp (so 0r<p0 \le r < p). Prove that r\sqrt{r} is not an integer.

Solution

Let (p)\left( \frac{\cdot}{p} \right) denote the Legendre symbol. We consider the two integers
M=x=1p1(1+x4p)andN=x=1p1(1+x8p). M = \sum_{x=1}^{p-1} \left( \frac{1+x^4}{p} \right) \quad \text{and} \quad N = \sum_{x=1}^{p-1} \left( \frac{1+x^8}{p} \right).
Notice that MM and NN are integers with M,N<p|M|, |N| < p. Also, we contend M4(mod8)M \equiv 4 \pmod 8 and N0(mod8)N \equiv 0 \pmod 8. For the sum MM, there are exactly four residues xx with x4=1x^4 = -1, and the remaining residues make 2k12k-1 groups of four contributing ±4\pm 4 to the sum. Similarly, in the sum NN we have groups of eight contributing 00 or ±8\pm 8.
On the other hand modulo pp we have
Mx=1p1(1+x4)4k(p1)(2+(4k2k))(modp) M \equiv \sum_{x=1}^{p-1} (1+x^4)^{4k} \equiv (p-1) \left(2 + \binom{4k}{2k}\right) \pmod{p}
and
Nx=1p1(1+x8)4k(p1)(2+2(4kk)+(4k2k))(modp). N \equiv \sum_{x=1}^{p-1} (1+x^8)^{4k} \equiv (p-1) \left(2 + 2\binom{4k}{k} + \binom{4k}{2k}\right) \pmod{p}.
whence
MN2(4kk)(modp). \frac{M-N}{2} \equiv \binom{4k}{k} \pmod{p}.
Note that MN22(mod4)\frac{M-N}{2} \equiv 2 \pmod 4 and lies in (p,p)(-p, p), hence
MN2{±2,±6,,±(p3)}. \frac{M-N}{2} \in \{\pm2, \pm6, \dots, \pm(p-3)\}.
Consequently r{2,3,6,7,10,11,,p3,p2}r \in \{2, 3, 6, 7, 10, 11, \dots, p-3, p-2\}. In particular, since squares are 00 or 11 mod 44, it follows rr is not a square.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from the original; metadata (topic, difficulty) added by this project.