Maths Olympiad Prep

Library / Romanian Mathematical Olympiad - Final Round /15 of 37

Romanian Mathematical Olympiad - Final Round

Algebra Difficulty 5.8 AIME, harder Prove it Romania

Determine the largest positive integer kk for which exists a positive integer nn such that:
sin(n+1)<sin⁡(n+2)<sin⁡(n+3)<⋯<sin⁡(n+k). sin(n + 1) < \sin(n + 2) < \sin(n + 3) < \dots < \sin(n + k).

Solution

We claim the largest number is k=5k = 5.

The difference of two consecutive terms is:
sin⁡(n+i+1)−sin⁡(n+i)=2sin⁡12cos⁡2n+2i+12>0⇔cos⁡2n+2i+12>0. (⋆) \sin(n+i+1)-\sin(n+i) = 2 \sin \frac{1}{2} \cos \frac{2n+2i+1}{2} > 0 \Leftrightarrow \cos \frac{2n+2i+1}{2} > 0. \ (\star)

Suppose that for k=6k = 6 there exists a positive integer nn such that sin⁡(n+1)<sin⁡(n+2)<sin⁡(n+3)<sin⁡(n+4)<sin⁡(n+5)<sin⁡(n+6)\sin(n + 1) < \sin(n + 2) < \sin(n + 3) < \sin(n + 4) < \sin(n + 5) < \sin(n + 6). Relation (⋆)(\star) is equivalent to:
cos⁡(n+2i+12)>0,i=1,5‾, \cos \left( n + \frac{2i + 1}{2} \right) > 0, \quad i = \overline{1, 5},
which implies that:
cos⁡(n+32)+cos⁡(n+112)=2cos⁡2⋅cos⁡(n+72)>0⇒cos⁡2>0, \cos \left(n + \frac{3}{2}\right) + \cos \left(n + \frac{11}{2}\right) = 2 \cos 2 \cdot \cos \left(n + \frac{7}{2}\right) > 0 \Rightarrow \cos 2 > 0,
which is a contradiction. Therefore, k≤5k \le 5.

For k=5k = 5 we need to find a positive integer nn which, according to (⋆)(\star), needs to satisfy cos⁡(n+2i+12)>0\cos(n + \frac{2i+1}{2}) > 0, i=1,4‾i = \overline{1,4}. From 2mπ−π2<n+32<n+92<2mπ+π2⇔(4m−1)⋅10π<20n+30<20n+90<(4m+1)⋅10π2m\pi - \frac{\pi}{2} < n + \frac{3}{2} < n + \frac{9}{2} < 2m\pi + \frac{\pi}{2} \Leftrightarrow (4m-1) \cdot 10\pi < 20n + 30 < 20n + 90 < (4m+1) \cdot 10\pi, considering 3.14<π<3.153.14 < \pi < 3.15, we obtain the following sufficient condition:
(4m−1)⋅31.5<20n+30<20n+90<(4m+1)⋅31.4⇒m≤7. (4m - 1) \cdot 31.5 < 20n + 30 < 20n + 90 < (4m + 1) \cdot 31.4 \Rightarrow m \le 7.
For m=7m = 7 we have the following bounds for nn:
27π−32<n<29π−92, \frac{27\pi - 3}{2} < n < \frac{29\pi - 9}{2},
which, due to having 3.141<π<3.1423.141 < \pi < 3.142, implies n=41n = 41, and thus proves our claim.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.