Maths Olympiad Prep

Track / Stage 8 / 118 of 180 #1818 of 1964

Problem 1818

IMO Shortlist mid-range; USAMO P2/P5
Algebra Difficulty 8.4 Find the answer imo_longlists

Find, with proof, the smallest real number CC with the following property:
For every infinite sequence {xi}\{x_i\} of positive real numbers such that x1+x2++xnxn+1x_1 + x_2 +\cdots + x_n \leq x_{n+1} for n=1,2,3,n = 1, 2, 3, \cdots, we have
x1+x2++xnCx1+x2++xnnN.\sqrt{x_1}+\sqrt{x_2}+\cdots+\sqrt{x_n} \leq C \sqrt{x_1+x_2+\cdots+x_n} \qquad \forall n \in \mathbb N.

A number or a short expression. Spacing, $ signs and \frac vs / are all fine.

Official solution

To find the smallest real number C C such that the inequality

x1+x2++xnCx1+x2++xn \sqrt{x_1} + \sqrt{x_2} + \cdots + \sqrt{x_n} \leq C \sqrt{x_1 + x_2 + \cdots + x_n}

holds for every infinite sequence {xi}\{x_i\} of positive real numbers satisfying

x1+x2++xnxn+1 x_1 + x_2 + \cdots + x_n \leq x_{n+1}

for all nN n \in \mathbb{N} , we proceed as follows:

### Step 1: Establish the constraints

Given an infinite sequence {xi}\{x_i\} where each term is positive and

x1+x2++xnxn+1 x_1 + x_2 + \cdots + x_n \leq x_{n+1}

for all nN n \in \mathbb{N} , means that each subsequent term is larger than the sum of all previous terms. This condition suggests rapid growth of the sequence terms.

### Step 2: Simplifying the inequality

We need to demonstrate the inequality:

x1+x2++xnCx1+x2++xn. \sqrt{x_1} + \sqrt{x_2} + \cdots + \sqrt{x_n} \leq C \sqrt{x_1 + x_2 + \cdots + x_n}.

### Step 3: Exploring a geometric interpretation

Consider squaring both sides to handle the square roots, while being aware of maintaining inequality:

(x1+x2++xn)2C2(x1+x2++xn). (\sqrt{x_1} + \sqrt{x_2} + \cdots + \sqrt{x_n})^2 \leq C^2 (x_1 + x_2 + \cdots + x_n).

Expanding the left-hand side:

x1+x2++xn+21i<jnxixjC2(x1+x2++xn). x_1 + x_2 + \cdots + x_n + 2 \sum_{1 \leq i < j \leq n} \sqrt{x_i x_j} \leq C^2 (x_1 + x_2 + \cdots + x_n).

### Step 4: Approximating CC

We hypothesize that each xn+1x1+x2++xn x_{n+1} \geq x_1 + x_2 + \cdots + x_n causes the sequence to grow exponentially. Consider xn2n1x1 x_n \approx 2^{n-1}x_1 . This strategy links the terms to exponential functions, simplifying calculations:

If x1+x2++xnxn x_1 + x_2 + \cdots + x_n \approx x_n , then:

xn(1+2)x1+x2++xn. \sqrt{x_n} \approx (1+\sqrt{2}) \sqrt{x_1 + x_2 + \cdots + x_n}.

This suggests

C=1+2, C = 1 + \sqrt{2},

satisfies the least value such that the inequality holds for the rapid growth conditions iterated through xn x_n .

Hence, the smallest real number C C is

1+2. \boxed{1 + \sqrt{2}}.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.