Number theoryDifficulty 8.4ShortlistProve itHong Kong
Let S be the set of all integers of the form x2+3xy+8y2 where x and y are integers.
a. Show that if u and v are in S, then so is uv.
b. Can an integer of the form 23k+7, with k an integer, belong to S?
Solution
a. The roots of z2+3z+8=0 are 2−3±23i. Let α=2−3+23i. Then αˉ=2−3−23i, and hence x2+3xy+8y2=(x−αy)(x−αˉy). Note that (x1−αy1)(x2−αy2)=(x1x2+α2y1y2)−α(x1y2+x2y1)=(x1x2+(−3α−8)y1y2)−α(x1y2+x2y1)=(x1x2−8y1y2)−α(x1y2+x2y1+3y1y2). Thus, defining s=x1x2−8y1y2 and t=x1y2+x2y1+3y1y2, we have (x12+3x1y1+8y12)(x22+3x2y2+8y22)=(x1−αy1)(x1−αˉy1)(x2−αy2)(x2−αˉy2)=(x1−αy1)(x2−αy2)((x1−αy1)(x2−αy2))=(s−αt)(s−αt)=(s−αt)(s−αˉt)=s2+3st+8t2. This clearly proves the result.
b. No. Suppose on the contrary that x2+3xy+8y2≡7(mod23) for some integers x and y. This implies 4x2+12xy+32y2≡28(mod23), and hence (2x+3y)2≡5(mod23). However, we can check that 5 is not a square modulo 23 by computing the Legendre symbol (235)=(523)=(53)=−1 (or by testing 02,(±1)2,…,(±11)2(mod23)). This is a contradiction, and so there is no such integer in S.
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.