Maths Olympiad Prep

Track / Stage 7 / 233 of 300 #1633 of 1964

Problem 1633

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

Give a prime number p>2023p>2023. Let r(x)r(x) be the remainder of xx modulo pp. Let p1<p2<<pmp_1<p_2< \ldots <p_m be all prime numbers less that 12p4\sqrt[4]{\frac{1}{2}p}. Let q1,q2,,qnq_1, q_2, \ldots, q_n be the inverses modulo pp of p1,p2,pnp_1, p_2, \ldots p_n. Prove that for every integers 0<a,b<p0 < a,b < p, the sets
{r(q1),r(q2),,r(qm)},  {r(aq1+b),r(aq2+b),,r(aqm+b)}\{r(q_1), r(q_2), \ldots, r(q_m)\}, ~~ \{r(aq_1+b), r(aq_2+b), \ldots, r(aq_m+b)\}
have at most 33 common elements.

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. **Uniqueness of qi q_i :**
- Given that qi q_i are the inverses modulo p p of pi p_i , it is clear that qi q_i are distinct. This is because if qiqj(modp) q_i \equiv q_j \pmod{p} for ij i \neq j , then pipj(modp) p_i \equiv p_j \pmod{p} , which contradicts the fact that pi p_i are distinct primes.

2. Condition for common elements:
- For a given a a and b b , there exists at most one index i i such that qiaqi+b(modp) q_i \equiv aq_i + b \pmod{p} . This can be seen by solving the equation qiaqi+b(modp) q_i \equiv aq_i + b \pmod{p} , which simplifies to qi(a1)b(modp) q_i (a - 1) \equiv b \pmod{p} . If a1 a \neq 1 , this has a unique solution qib(a1)1(modp) q_i \equiv b(a-1)^{-1} \pmod{p} .

3. Assumption of at least 4 common elements:
- Suppose the sets {r(q1),r(q2),,r(qm)} \{r(q_1), r(q_2), \ldots, r(q_m)\} and {r(aq1+b),r(aq2+b),,r(aqm+b)} \{r(aq_1 + b), r(aq_2 + b), \ldots, r(aq_m + b)\} have at least 4 common elements. Then there exist indices i1,i2,i3,i4 i_1, i_2, i_3, i_4 and j1,j2,j3,j4 j_1, j_2, j_3, j_4 such that qikaqjk+b(modp) q_{i_k} \equiv aq_{j_k} + b \pmod{p} for k=1,2,3,4 k = 1, 2, 3, 4 .

4. Deriving a contradiction:
- From the above, we have:
aqi1qi2qj1qj2qi1qi3qj1qj3(modp) a \equiv \frac{q_{i_1} - q_{i_2}}{q_{j_1} - q_{j_2}} \equiv \frac{q_{i_1} - q_{i_3}}{q_{j_1} - q_{j_3}} \pmod{p}
This implies:
(qi1qi2)(qj1qj3)(qi1qi3)(qj1qj2)(modp) (q_{i_1} - q_{i_2})(q_{j_1} - q_{j_3}) \equiv (q_{i_1} - q_{i_3})(q_{j_1} - q_{j_2}) \pmod{p}

5. Multiplying both sides:
- Multiplying both sides by pi1pi2pi3pj1pj2pj3 p_{i_1} p_{i_2} p_{i_3} p_{j_1} p_{j_2} p_{j_3} :
pi3pj2(pi2pi1)(pj3pj1)pi2pj3(pi3pi1)(pj2pj1)(modp) p_{i_3} p_{j_2} (p_{i_2} - p_{i_1})(p_{j_3} - p_{j_1}) \equiv p_{i_2} p_{j_3} (p_{i_3} - p_{i_1})(p_{j_2} - p_{j_1}) \pmod{p}

6. Absolute value consideration:
- Both numbers in absolute value are smaller than 12p \frac{1}{2}p , because pi<12p4 p_i < \sqrt[4]{\frac{1}{2}p} for all these primes. This means we have equality between those numbers:
pi3pj2(pi2pi1)(pj3pj1)=pi2pj3(pi3pi1)(pj2pj1) p_{i_3} p_{j_2} (p_{i_2} - p_{i_1})(p_{j_3} - p_{j_1}) = p_{i_2} p_{j_3} (p_{i_3} - p_{i_1})(p_{j_2} - p_{j_1})

7. Contradiction:
- Since pi3 p_{i_3} does not divide any of these numbers: pj2 p_{j_2} , pj3 p_{j_3} , and pi3pi1 p_{i_3} - p_{i_1} , it follows that pi3pj2pj1 p_{i_3} \mid p_{j_2} - p_{j_1} . Thus:
pi3pj2pj1<max{pj2,pj1}max{pi1,pi2,pi3,pj1,pj2,pj3} p_{i_3} \leq |p_{j_2} - p_{j_1}| < \max\{p_{j_2}, p_{j_1}\} \leq \max \{p_{i_1}, p_{i_2}, p_{i_3}, p_{j_1}, p_{j_2}, p_{j_3}\}
- This leads to a contradiction because there is some p p which is the maximum.

Therefore, the sets {r(q1),r(q2),,r(qm)} \{r(q_1), r(q_2), \ldots, r(q_m)\} and {r(aq1+b),r(aq2+b),,r(aqm+b)} \{r(aq_1 + b), r(aq_2 + b), \ldots, r(aq_m + b)\} can have at most 3 common elements.

\blacksquare

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