Maths Olympiad Prep

Library / /190 of 520

Number theory Difficulty 5.9 AIME, harder Prove it

19. Let the prime p1(mod6)p \equiv 1(\bmod 6). Prove: There must be integers u,vu, v satisfying
4p=u2+27v2,u1(mod3)4 p=u^{2}+27 v^{2}, \quad u \equiv 1(\bmod 3)
(Hint:
4(a2ab+b2)=(a+b)2+3(ab)2=(2ab)2+3b2=(2ba)2+3a2)\begin{aligned} 4\left(a^{2}-a b+b^{2}\right) & =(a+b)^{2}+3(a-b)^{2} \\ & =(2 a-b)^{2}+3 b^{2} \\ & \left.=(2 b-a)^{2}+3 a^{2}\right) \end{aligned}

Solution

19. Using the previous problem and a,b,aba, b, a-b, it is always possible to make one of them divisible by 3.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.