Maths Olympiad Prep

Library / /637 of 740

, 2017

Algebra Difficulty 5.4 AIME, harder Prove it United States

Problem:

Given that a,b,ca, b, c are integers with abc=60a b c = 60, and that complex number ω1\omega \neq 1 satisfies ω3=1\omega^{3} = 1, find the minimum possible value of a+bω+cω2\left| a + b \omega + c \omega^{2} \right|.

Solution

Solution:

Since ω3=1\omega^{3} = 1, and ω1\omega \neq 1, ω\omega is a third root of unity. For any complex number z,z2=zzˉz, |z|^{2} = z \cdot \bar{z}. Letting z=a+bω+cω2z = a + b \omega + c \omega^{2}, we find that zˉ=a+cω+bω2\bar{z} = a + c \omega + b \omega^{2}, and
z2=a2+abω+acω2+abω2+b2+bcω+acω+bcω2+c2=(a2+b2+c2)+(ab+bc+ca)(ω)+(ab+bc+ca)(ω2)=(a2+b2+c2)(ab+bc+ca)=12((ab)2+(bc)2+(ca)2), \begin{aligned} |z|^{2} & = a^{2} + a b \omega + a c \omega^{2} + a b \omega^{2} + b^{2} + b c \omega + a c \omega + b c \omega^{2} + c^{2} \\ & = \left(a^{2} + b^{2} + c^{2}\right) + (a b + b c + c a)(\omega) + (a b + b c + c a)\left(\omega^{2}\right) \\ & = \left(a^{2} + b^{2} + c^{2}\right) - (a b + b c + c a) \\ & = \frac{1}{2}\left((a-b)^{2} + (b-c)^{2} + (c-a)^{2}\right), \end{aligned}
where we have used the fact that ω3=1\omega^{3} = 1 and that ω+ω2=1\omega + \omega^{2} = -1. This quantity is minimized when a,ba, b, and cc are as close to each other as possible, making a=3,b=4,c=5a = 3, b = 4, c = 5 the optimal choice, giving z2=3|z|^{2} = 3. (A smaller value of z|z| requires two of a,b,ca, b, c to be equal and the third differing from them by at most 2, which is impossible.) So zmin=3|z|_{\text{min}} = \sqrt{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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.