Maths Olympiad Prep

Library / Silk Road Mathematics Competition competition problems /19 of 25

Silk Road Mathematics Competition competition problems

Number theory Difficulty 6.6 National Olympiad Prove it Silk Road Mathematics Competition

A subset SS of the set M={1,2,…,p−1}M = \{1, 2, \dots, p-1\}, where pp is a prime number of the kind 12n+1112n + 11 is essential, if the product Πs\Pi_s of all elements of the subset is not less than the product Π‾s\overline{\Pi}_s of all other elements of the set. The difference Δs=Πs−Π‾s\Delta_s = \Pi_s - \overline{\Pi}_s is called the deviation of the subset SS. Determine the least possible remainder of division by pp of the deviation of an essential subset, containing p−12\frac{p-1}{2} elements.

Solution

Answer: 2.
Let's consider the subset S={(p+1)/2,…,p−2,p−1}S = \{(p+1)/2, \dots, p-2, p-1\}. Then
Πs=(−1)p−12(p−12)!=−(p−12)!≡a(modp), \Pi_s = (-1)^{\frac{p-1}{2}} \left(\frac{p-1}{2}\right)! = - \left(\frac{p-1}{2}\right)! \equiv a \pmod{p},
Π‾s=(p−12)!≡−a(modp). \overline{\Pi}_s = \left(\frac{p-1}{2}\right)! \equiv -a \pmod{p}.
By the Wilson's theorem a2≡1(modp)a^2 \equiv 1 \pmod{p}. Hence, two cases are possible:
Case 1. a≡1(modp)a \equiv 1 \pmod{p}. Then the deviation of the essential subset SS is equal to Δs=2(modp)\Delta_s = 2 \pmod{p}.
Case 2. a≡−1(modp)a \equiv -1 \pmod{p}. Then the deviation of the essential subset TT, where TT is obtained from SS by substituting p+12\frac{p+1}{2} to p−12≡−p+12(modp)\frac{p-1}{2} \equiv -\frac{p+1}{2} \pmod{p}, is equal to ΔT=ΠT−Π‾T≡1−(−1)≡2(modp)\Delta_T = \Pi_T - \overline{\Pi}_T \equiv 1 - (-1) \equiv 2 \pmod{p}.
Now we prove that 22 is the least possible remainder.
Note that Πs⋅Π‾s=−1\Pi_s \cdot \overline{\Pi}_s = -1 by the Wilson's theorem again. Since −1-1 is not a quadratic residue by modulo a prime number of the kind 4k+34k+3, we have certainly Πs≠Π‾s(modp)\Pi_s \neq \overline{\Pi}_s \pmod{p}. In other words, the deviation is not divisible by pp. Suppose to the contrary, let SS be a subset with deviation Πs−Π‾s=1\Pi_s - \overline{\Pi}_s = 1. Then Πs≡m+1(modp)\Pi_s \equiv m+1 \pmod{p}, Π‾s≡m(modp)\overline{\Pi}_s \equiv m \pmod{p} for some m∈{2,3,…,p−3}m \in \{2, 3, \dots, p-3\} and m2+m≡−1(modp)m^2 + m \equiv -1 \pmod{p}. This implies m3≡1(modp)m^3 \equiv 1 \pmod{p} and by the Fermat's (little) theorem p−1p-1 is divisible by 33, which is a contradiction.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.