China Team Selection Test

Let $\left(a_n\right)$ be the sequence of reals defined by $a_1 = \frac{1}{4}$ and the recurrence $a_n = \frac{1}{4}(1 + a_{n-1})^2$ for $n \geq 2$. We aim to find the minimum real $\lambda$ such that for any non-negative reals $x_1, x_2, \dots, x_{2002}$, it holds that
$$\sum_{k=1}^{2002} A_k \leq \lambda a_{2002},$$
where $A_k = \frac{x_k - k}{(x_k + \cdots + x_{2002} + \frac{k(k-1)}{2} + 1)^2}$ for $k \geq 1$.

First, we simplify the problem by setting $t = 2002$. For $k = 1, 2, \dots, t$, define
$$y_k = x_k + x_{k+1} + \dots + x_t + \frac{k(k-1)}{2} + 1,$$
and let $L = y_{t+1} = \frac{(t+1)t}{2} + 1$. Notice that $y_k - y_{k+1} = x_k - k$ for $1 \leq k \leq t$. Thus, we need to maximize the sum
$$S = \sum_{k=1}^{2002} A_k = \sum_{k=1}^{2002} \frac{y_k - y_{k+1}}{y_k^2}.$$

We use the following lemma to proceed:

Lemma 1. The inequality $\frac{ax - b}{x^2} \leq \frac{a^2}{4} \cdot \frac{1}{b}$ holds for all $x \in \mathbb{R} \setminus \{0\}$ with equality when $x = \frac{2b}{a}$, where $a, b > 0$.

Proof. Multiplying by $4bx^2 > 0$, we need $4abx - 4b^2 \leq a^2x^2$, which simplifies to $(ax - 2b)^2 \geq 0$. $\blacksquare$

Lemma 2. Define the sequence $b_1 = 0$ and $b_n = \frac{1}{4}(1 + b_{n-1})^2$ for $n \geq 2$. Then
$$\frac{b_k}{y_k} + \frac{y_k - y_{k+1}}{y_k^2} \leq \frac{b_{k+1}}{y_{k+1}}$$
for all $1 \leq k \leq n$.

Proof. Using Lemma 1, we find
$$\frac{b_k}{y_k} + \frac{y_k - y_{k+1}}{y_k^2} = \frac{(b_k + 1)y_k - y_{k+1}}{y_k^2} \leq \frac{(b_k + 1)^2}{4} \cdot \frac{1}{y_{k+1}} = \frac{b_{k+1}}{y_{k+1}}. \quad \blacksquare$$

Summing these inequalities for $k = 1, 2, \dots, t$ gives
$$0 \geq \sum_{k=1}^t \left( \frac{b_k}{y_k} + \frac{y_k - y_{k+1}}{y_k^2} - \frac{b_{k+1}}{y_{k+1}} \right) = S - \frac{b_{t+1}}{y_{t+1}},$$
so $S \leq \frac{b_{t+1}}{L}$.

To achieve the maximum with non-negative $x_k$, equality holds if and only if $y_k = \frac{2y_{k+1}}{b_k + 1}$ for $k = 1, 2, \dots, t$. This ensures all $y_k$ are positive. Induction shows $0 \leq b_n \leq 1$ for all $n \geq 1$, implying $y_k = \frac{2}{b_k + 1} y_{k+1} \geq y_{k+1}$, ensuring $x_k \geq 0$.

Since $b_2 = \frac{1}{4}$ and $b_{n+1} = a_n$, the maximum $S = \frac{b_{t+1}}{L} = \frac{1}{L} a_t$. Thus, the constant $\lambda$ is
$$\lambda = \frac{1}{\frac{2003 \cdot 2002}{2} + 1} = \frac{1}{2005004}.$$

The answer is: $\boxed{\frac{1}{2005004}}.$