19. Let the prime p≡1(mod6). Prove: There must be integers u,v satisfying 4p=u2+27v2,u≡1(mod3) (Hint: 4(a2−ab+b2)=(a+b)2+3(a−b)2=(2a−b)2+3b2=(2b−a)2+3a2)
Solution
19. Using the previous problem and a,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.