Maths Olympiad Prep

Library / /25 of 49

, 2022

Number theory Difficulty 6.1 National Olympiad Prove it Bulgaria

Find the smallest odd prime pp for which there exist positive co-prime integers kk and \ell, such that
4k3=12and2+k+k23(modp). 4k - 3\ell = 12 \quad \text{and} \quad \ell^2 + \ell k + k^2 \equiv 3 \pmod{p}.

Solution

From 4k=12+34k = 12 + 3\ell, it follows k=3k1k = 3k_1, k1Nk_1 \in \mathbb{N}. Analogously, =41\ell = 4\ell_1, 1N\ell_1 \in \mathbb{N}. Assuming p=3p = 3 gives rise to 3k3 \mid k and 32+k+k23(k,)3>13 \mid \ell^2 + \ell k + k^2 \Rightarrow 3 \mid \ell \Rightarrow (k, \ell) \ge 3 > 1, a contradiction with (k,)=1(k, \ell) = 1. Thus, p>3p > 3, (3,p)=1(3, p) = 1, and
2+k+k23(modp)    92+9k+9k227(modp)    (4k12)2+(4k12)3k+9k227(modp)    16k296k+144+12k236k+9k2270(modp)    37k2132k+1170(modp)    (37k)226637k+117370(modp)    (37k66)26621173727(modp)    (37k122)23(modp), \begin{aligned} \ell^2 + \ell k + k^2 \equiv 3 \pmod{p} &\iff 9\ell^2 + 9\ell k + 9k^2 \equiv 27 \pmod{p} \\ &\iff (4k - 12)^2 + (4k - 12)3k + 9k^2 \equiv 27 \pmod{p} \\ &\iff 16k^2 - 96k + 144 + 12k^2 - 36k + 9k^2 - 27 \equiv 0 \pmod{p} \\ &\iff 37k^2 - 132k + 117 \equiv 0 \pmod{p} \\ &\iff (37k)^2 - 2 \cdot 66 \cdot 37 \cdot k + 117 \cdot 37 \equiv 0 \pmod{p} \\ &\iff (37k - 66)^2 \equiv 66^2 - 117 \cdot 37 \equiv 27 \pmod{p} \\ &\iff (37k_1 - 22)^2 \equiv 3 \pmod{p}, \end{aligned}
meaning that 3 must be a quadratic residue modulo pp. Since the quadratic residues mod 5 and mod 7 are respectively {0,1,4}\{0, 1, 4\} and {0,1,2,4}\{0, 1, 2, 4\}, 3 is not among them and p{5,7}p \notin \{5, 7\}, i.e., p11p \ge 11. For p=11p = 11, 112211 \mid 22 and 374(mod11)37 \equiv 4 \pmod{11}. Therefore, it suffices to find a solution for (4k1)23(mod11)(4k_1)^2 \equiv 3 \pmod{11}, which modulo 11 is equivalent to k125(mod11)k_1^2 \equiv 5 \pmod{11}, i.e., k1=11k2+4k_1 = 11k_2 + 4 or k1=11k2+7k_1 = 11k_2 + 7. We have to additionally assure (k,)=1(k, \ell) = 1. We know that k1=1+1k_1 = 1 + \ell_1, thus (k1,1)=1(k_1, \ell_1) = 1. Therefore, it suffices to take (k1,4)=1(k_1, 4) = 1 and (1,3)=1(\ell_1, 3) = 1, e.g., k1=15k_1 = 15. Then 1=14\ell_1 = 14, k=45k = 45, =56\ell = 56, (k,)=1(k, \ell) = 1, and from k1(mod11)k \equiv \ell \equiv 1 \pmod{11} we check that
2+k+k212+11+123(mod11). \ell^2 + \ell k + k^2 \equiv 1^2 + 1 \cdot 1 + 1^2 \equiv 3 \pmod{11}.
In conclusion, the answer is p=11p = 11.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.