IMO 2010 #6

by Wolstenholme, Nov 5, 2014, 8:57 PM

Let $a_1, a_2, a_3, \ldots$ be a sequence of positive real numbers, and $s$ be a positive integer, such that
\[a_n = \max \{ a_k + a_{n-k} \mid 1 \leq k \leq n-1 \} \ \textrm{ for all } \ n > s.\]
Prove there exist positive integers $\ell \leq s$ and $N$, such that
\[a_n = a_{\ell} + a_{n - \ell} \ \textrm{ for all } \ n \geq N.\]

Proof:

So this took me quite a while to solve, so as I go through the proof I will include the motivation for each step.

The first thing to ask yourself is "how does $ a_n $ grow"? What function $ f $ seems to satisfy $ f(n) = f(n - \ell) + f(\ell)? $ Well, clearly the answer is a function of the form $ f(n) = cn $ for some constant $ c. $ This motivates the following lemma:

Lemma 1: Let $ \ell \in \{1, 2, 3, \dots, s\} $ such that $ \frac{a_{\ell}}{\ell} \ge \frac{a_n}{n} $ for all $ n \in \{1, 2, 3, \dots, s\}. $ Then $ \frac{a_{\ell}}{\ell} \ge \frac{a_n}{n} $ for all $ n \in \mathbb{Z}. $

Proof: We proceed by strong induction. The base case when $ n \in \{1, 2, 3, \dots, s\} $ follows from the definition of $ \ell. $ Now for any $ n \in \mathbb{Z} $ we have for some positive integer $ k < n $ that $ {\ell}a_n = {\ell}a_k + {\ell}a_{n - k} \le ka_{\ell} + (n - k)a_{\ell} = na_{\ell} $ as desired.

Now, what are we looking for? Well, we want the sequence $ \{a_n\} $ to follow a sort of pattern. Knowing its general asymptotics, we are motivated to do the following: let $ b_n = na_{\ell} - {\ell}a_n $ for all $ n \in \mathbb{N}. $ Note that by Lemma 1 this sequence consists only of nonnegative numbers.

If you've written out some sequences, it should be clear that our $ \ell $ is exactly the $ \ell $ that the problem asks to find. So wouldn't it be nice to rephrase what we want to prove in terms of the new sequence $ \{b_n\}? $ Well, after some searching, we find that in fact all we want to show is that for sufficiently large $ n $, we have that $ b_n = b_{n + \ell} $ for all $n \in \mathbb{N}. $ Let's write this as a lemma.

Lemma 2: To solve the problem, it suffices to show that for all sufficiently large $ n \in \mathbb{N} $ we have $ b_n = b_{n + \ell}. $

Proof: Note that $ b_n = b_{n + \ell} \Longrightarrow na_{\ell} - {\ell}a_n = (n + \ell)a_{\ell} - {\ell}a_{n + \ell} \Longrightarrow a_{n + \ell} = a_n + a_{\ell} $ which proves the lemma.

So, how can we show this? Well, we know that the sequence $ \{b_n\} $ is bounded from below by $ 0 $ so it would suffices to show that the sequence is weakly decreasing; namely, that $ b_n \ge b_{n + \ell} $ for all $ n \in \mathbb{N}. $ Rephrasing this in terms of the original sequence of $ a $'s, we find that it suffices to show that $ a_{n + \ell} \ge a_n + a_{\ell} $ but this follows immediately from the definition of the $ a $'s so we are done.

Comment

0 Comments

Archives
+ June 2016
+ April 2016
+ March 2016
+ July 2015
+ February 2015
+ June 2014
Shouts
Submit
  • glad to have found a fellow chipotle lover <3

    by nukelauncher, Aug 13, 2020, 6:40 AM

  • the random chinese tst problem is the only thing I read, but I'll assume your blog is nice and give you a shout even though you probably never use aops anymoer

    by fukano_2, Jun 14, 2020, 6:24 AM

  • wolstenholme - op

    by AopsUser101, Jan 29, 2020, 8:27 PM

  • this blog is so hot

    by mathleticguyyy, Jun 5, 2019, 8:26 PM

  • Hi. Nice Blog!

    by User360702, Jan 10, 2019, 6:03 PM

  • helloooooo

    by songssari, Jun 12, 2016, 8:21 AM

  • shouts make blogs happier

    by briantix, Mar 18, 2016, 9:57 PM

  • You were just featured on AoPS's facebook page.

    by mishka1980, Sep 12, 2015, 10:33 PM

  • This is late, but where is the ARML results post?

    by donot, Aug 31, 2015, 11:07 PM

  • "I am Sam"
    "Sam I am"

    by mathwizard888, Aug 12, 2015, 9:13 PM

  • HW$\textcolor{white}{}$

    by Eugenis, Apr 20, 2015, 10:10 PM

  • Uh-oh ARML practice is Thursday... I should start the homework. :P

    by nosaj, Apr 20, 2015, 12:34 AM

  • Yes I am Sam, and Chebyshev polynomials aren't trivial, although they do make some problems trivial :P

    by Wolstenholme, Apr 15, 2015, 10:00 PM

  • How are Chebyshev Polynomials trivial? :P

    by nosaj, Apr 13, 2015, 4:10 AM

  • Are you Sam?

    by Eugenis, Apr 4, 2015, 2:05 AM

  • @Brian: yes, yes I did #whoneedsalgskillz?

    @gauss1181; hey!

    by Wolstenholme, Mar 1, 2015, 11:25 PM

  • hello!!! :D

    by gauss1181, Nov 27, 2014, 12:19 AM

  • Hi Wolstenholme did you actually use calc on that tstst problem :o

    by briantix, Aug 2, 2014, 12:25 AM

18 shouts
Contributors
Tags
About Owner
  • Posts: 543
  • Joined: Mar 3, 2013
Blog Stats
  • Blog created: Apr 3, 2013
  • Total entries: 112
  • Total visits: 35003
  • Total comments: 167
Search Blog
a