Let C={z∈C∣∣z∣=1} be the unit circle in the complex plane. 240 complex numbers z1,z2,…,z240∈C (can be repeated) satisfy the following conditions: (1) for any open arc Γ of length π on C, there are at most 200 j's (1≤j≤240) such that zj∈Γ; (2) for any open arc γ of length 3π on C, there are at most 120 j's (1≤j≤240) such that zj∈γ.
Find the maximum of ∣z1+z2+⋯+z240∣.
Solution
The maximum is 80+403. Take 80 of 1's, 40 of each of exp(6πi), exp(−6πi), i, −i. It is straightforward to check that they satisfy (1), (2), and their sum equals 80+403. We need to show this is the maximum value.
Let z1,z2,…,z240 satisfy (1), (2). By rotation if necessary, we may assume that S=z1+z2+⋯+z240 is a nonnegative real number; starting from −1 (included) along C, in the counterclockwise order, let the numbers be z1,z2,…,z240.
Condition (1) indicates that for 1≤j≤40, to go from zj to zj+200 along C, at least an arc of length π is needed, that is to say, there exists 2π≥α≥π such that zj+200=zj⋅exp(αi). Let zj=(−1)⋅exp(βi), β∈[0,2π). From argzj+200 we see β+α<2π, and thus Re(zj+zj+200)=−cosβ−cos(β+α)=−2cos2αcos(β+2α)≤0(because 2α∈[2π,π],β+2α∈[2π,23π]). Summing up 1≤j≤40, weobtain Re(z1+z2+⋯+z40+z201+z202+⋯+z240)≤0.1◯
Similarly, condition (2) indicates that for 41≤j≤80, to go from zj to zj+120 along C, at least an arc of length 3π is needed. So there exists 2π≥α≥3π, such that zj+120=zj⋅exp(αi). Let zj=(−1)⋅exp(βi), β∈[0,2π). From argzj+120 we see β+α<2π, and thus Re(zj+zj+120)=−cosβ−cos(β+α)=−2cos2αcos(β+2α). If α≥π, the above quantity is non-positive; if α∈[3π,π), then 2cos2αcos(β+2α)≤2×cos6π×1=3, so the real part is ≤3. Summing up for 41≤j≤80, we obtain Re(z41+z42+⋯+z80+z161+z162+⋯+z200)≤403.2◯
The inequalities (1) and (2) lead to an estimate of the sum ∣z1+z2+⋯+z240∣=Re(j=1∑40(zj+z200+j))+Re(j=41∑80(zj+z120+j))+Re(j=81∑120zj)≤0+403+80=80+403.
Here, the maximum is attained only when the numbers are: 80 of 1's, 40 of each of exp(6πi), exp(−6πi), i, −i (or by any rotation). □
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.