Olympiad Maths Prep

Track / Stage 6 / 108 of 400 #1108 of 2000

Problem 1108

National olympiad, first round
Algebra Difficulty 6.2 Prove it 7th JBMO · JBMO

Problem:

Natural numbers 1,2,3,,20031, 2, 3, \ldots, 2003 are written in an arbitrary sequence a1,a2,a3,,a2003a_{1}, a_{2}, a_{3}, \ldots, a_{2003}. Let b1=1a1b_{1} = 1 a_{1}, b2=2a2b_{2} = 2 a_{2}, b3=3a3b_{3} = 3 a_{3}, \ldots, b2003=2003a2003b_{2003} = 2003 a_{2003}, and BB be the maximum of the numbers b1,b2,b3,,b2003b_{1}, b_{2}, b_{3}, \ldots, b_{2003}.

a) If a1=2003,a2=2002,a3=2001,,a2002=2,a2003=1a_{1} = 2003, a_{2} = 2002, a_{3} = 2001, \ldots, a_{2002} = 2, a_{2003} = 1, find the value of BB.

b) Prove that B10022B \geq 1002^{2}.

Problem:

Numerele 1,2,3,,20031, 2, 3, \ldots, 2003 sunt scrise într-un şir a1,a2,a3,,a2003a_{1}, a_{2}, a_{3}, \ldots, a_{2003}. Fie b1=1a1b_{1} = 1 a_{1}, b2=2a2b_{2} = 2 a_{2}, b3=3a3b_{3} = 3 a_{3}, \ldots, b2003=2003a2003b_{2003} = 2003 a_{2003} şi BB maximul numerelor b1,b2,b3,,b2003b_{1}, b_{2}, b_{3}, \ldots, b_{2003}.

a) Dacă a1=2003,a2=2002,a3=2001,,a2003=1a_{1} = 2003, a_{2} = 2002, a_{3} = 2001, \ldots, a_{2003} = 1, găsiți valoarea lui BB.

b) Demonstrați că B10022B \geq 1002^{2}.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Solution:

a) Using the inequality between the arithmetical and geometrical mean, we obtain that bn=n(2004n)(n+(2004n)2)2=10022b_{n} = n (2004 - n) \leq \left( \frac{n + (2004 - n)}{2} \right)^{2} = 1002^{2} for n=1,2,3,,2003n = 1, 2, 3, \ldots, 2003. The equality holds if and only if n=2004nn = 2004 - n, i.e. n=1002n = 1002. Therefore, B=b1002=1002×(20041002)=10022B = b_{1002} = 1002 \times (2004 - 1002) = 1002^{2}.

b) Let a1,a2,a3,,a2003a_{1}, a_{2}, a_{3}, \ldots, a_{2003} be an arbitrary order of the numbers 1,2,3,,20031, 2, 3, \ldots, 2003. First, we will show that numbers 1002,1003,1004,,20031002, 1003, 1004, \ldots, 2003 cannot occupy the places numbered 1,2,3,,10011, 2, 3, \ldots, 1001 only. Indeed, we have (20031002)+1=1002(2003 - 1002) + 1 = 1002 numbers and 10021002 places. This means that at least one of the numbers 1002,1003,1004,,20031002, 1003, 1004, \ldots, 2003, say ama_{m}, lies on a place which number mm is greater than 10011001. Therefore, Bma1002×1002=10022B \geq m a \geq 1002 \times 1002 = 1002^{2}.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.