Difference between revisions of "2002 OIM Problems/Problem 3"
| Line 2: | Line 2: | ||
Pablo was copying the following problem: | Pablo was copying the following problem: | ||
| − | + | <cmath>\textit{Consider all sequences of 2004 real numbers}(x_0,x_1,x_2,\cdots , x_{2003})\textit{, such that}</cmath> | |
<cmath>x_0=1\text{,}</cmath> | <cmath>x_0=1\text{,}</cmath> | ||
| Line 14: | Line 14: | ||
<cmath>0\le x_{2003} \le 2x_{2004} \text{.}</cmath> | <cmath>0\le x_{2003} \le 2x_{2004} \text{.}</cmath> | ||
| − | <cmath>\ | + | <cmath>\textit{Among all these sequences, find the one for which the following expression takes its largest value:}</cmath> |
| − | <cmath>S = ...</cmath> | + | <cmath>S = ...</cmath> |
When Pablo was going to copy the expression for <math>S</math>, they erased the blackboard. The only thing he could remember was that <math>S</math> was of the form | When Pablo was going to copy the expression for <math>S</math>, they erased the blackboard. The only thing he could remember was that <math>S</math> was of the form | ||
Revision as of 15:34, 13 December 2023
Problem
Pablo was copying the following problem:
![\[\textit{Consider all sequences of 2004 real numbers}(x_0,x_1,x_2,\cdots , x_{2003})\textit{, such that}\]](http://latex.artofproblemsolving.com/8/0/6/8066c871940baeb9c704b5956cd9f9ea3172b30c.png)
![\[x_0=1\text{,}\]](http://latex.artofproblemsolving.com/7/1/0/7105128b22cc531f7e576cfa1adc6450043414a5.png)
![\[0\le x_1 \le 2x_0 \text{,}\]](http://latex.artofproblemsolving.com/7/c/e/7ce41adc2095765e2245ca25606984ca92429b43.png)
![\[0\le x_2 \le 2x_1 \text{,}\]](http://latex.artofproblemsolving.com/0/2/2/022158d922f05ea61ff38d739667b0e1158463d8.png)
![\[\vdots\]](http://latex.artofproblemsolving.com/7/6/4/76403adfdd35fb846675aaeaac92daec680a4fba.png)
![\[0\le x_{2003} \le 2x_{2004} \text{.}\]](http://latex.artofproblemsolving.com/6/a/0/6a0dd99faf558b05a6ab6570b9bdbdd432731893.png)
![\[\textit{Among all these sequences, find the one for which the following expression takes its largest value:}\]](http://latex.artofproblemsolving.com/4/4/2/4427e71f8d2a3a311672edaa6d1437cb61830836.png)
![\[S = ...\]](http://latex.artofproblemsolving.com/b/c/2/bc258e2b9facb2ca2d82ed814496ea646232627e.png)
When Pablo was going to copy the expression for 
, they erased the blackboard. The only thing he could remember was that was of the form
![\[S=\pm x_1\pm x_2\pm \cdots\pm x_{2002}+x_{2003}\]](http://latex.artofproblemsolving.com/e/9/f/e9ff6369960142dea4bafc4a3b8ccf6c2d55413e.png)
where the last term, 
, had a coefficient +1, and the previous ones had a coefficient +1 or -1. Show that Paul, despite not having the complete statement, can find with certainty the solution to the problem.
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
