Maths Olympiad Prep

Library / /117 of 136

Number theory Difficulty 8.4 Shortlist Prove it Hong Kong

Let SS be the set of all integers of the form x2+3xy+8y2x^2 + 3xy + 8y^2 where xx and yy are integers.

a. Show that if uu and vv are in SS, then so is uvuv.

b. Can an integer of the form 23k+723k + 7, with kk an integer, belong to SS?

Solution

a.
The roots of z2+3z+8=0z^2 + 3z + 8 = 0 are 3±23i2\frac{-3 \pm \sqrt{23}i}{2}. Let α=3+23i2\alpha = \frac{-3 + \sqrt{23}i}{2}. Then αˉ=323i2\bar{\alpha} = \frac{-3 - \sqrt{23}i}{2}, and hence x2+3xy+8y2=(xαy)(xαˉy)x^2 + 3xy + 8y^2 = (x - \alpha y)(x - \bar{\alpha}y). Note that
(x1αy1)(x2αy2)=(x1x2+α2y1y2)α(x1y2+x2y1)=(x1x2+(3α8)y1y2)α(x1y2+x2y1)=(x1x28y1y2)α(x1y2+x2y1+3y1y2). \begin{aligned} (x_1 - \alpha y_1)(x_2 - \alpha y_2) &= (x_1 x_2 + \alpha^2 y_1 y_2) - \alpha(x_1 y_2 + x_2 y_1) \\ &= (x_1 x_2 + (-3\alpha - 8)y_1 y_2) - \alpha(x_1 y_2 + x_2 y_1) \\ &= (x_1 x_2 - 8y_1 y_2) - \alpha(x_1 y_2 + x_2 y_1 + 3y_1 y_2). \end{aligned}
Thus, defining s=x1x28y1y2s = x_1x_2 - 8y_1y_2 and t=x1y2+x2y1+3y1y2t = x_1y_2 + x_2y_1 + 3y_1y_2, 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. \begin{aligned} & (x_1^2 + 3x_1y_1 + 8y_1^2)(x_2^2 + 3x_2y_2 + 8y_2^2) \\ &= (x_1 - \alpha y_1)(x_1 - \bar{\alpha} y_1)(x_2 - \alpha y_2)(x_2 - \bar{\alpha} y_2) \\ &= (x_1 - \alpha y_1)(x_2 - \alpha y_2)(\overline{(x_1 - \alpha y_1)(x_2 - \alpha y_2)}) \\ &= (s - \alpha t)\overline{(s - \alpha t)} \\ &= (s - \alpha t)(s - \bar{\alpha} t) \\ &= s^2 + 3st + 8t^2. \end{aligned}
This clearly proves the result.

b.
No. Suppose on the contrary that x2+3xy+8y27(mod23)x^2 + 3xy + 8y^2 \equiv 7 \pmod{23} for some integers xx and yy. This implies 4x2+12xy+32y228(mod23)4x^2 + 12xy + 32y^2 \equiv 28 \pmod{23}, and hence (2x+3y)25(mod23)(2x + 3y)^2 \equiv 5 \pmod{23}. However, we can check that 5 is not a square modulo 23 by computing the Legendre symbol (523)=(235)=(35)=1\binom{5}{23} = \binom{23}{5} = \binom{3}{5} = -1 (or by testing 02,(±1)2,,(±11)2(mod23)0^2, (\pm 1)^2, \dots, (\pm 11)^2 \pmod{23}). This is a contradiction, and so there is no such integer in SS.

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.