math-ai/BlueMO
BlueMO 🚀 BlueMO: A Comprehensive Collection of Challenging Mathematical Olympiad Problems from the Little Blue Book Series BlueMO is a comprehensive and challenging dataset comprising mathematical olympiad problems paired with detailed solutions, meticulously curated from the esteemed "Little Blue Book" (小蓝书) series (Second Edition)—a vital resource for Chinese students training for national and international olympiad math competitions. Designed to… See the full description on the dataset page: https://huggingface.co/datasets/math-ai/BlueMO.
39.7k
1{2 "source_file": "./raw_volume-zh/volume5/chapter1.tex",3 "problem_type": "calculation",4 "problem": "例19. 求函数 $f_n\\left(x_1, x_2, \\cdots, x_n\\right)=\\frac{x_1}{\\left(1+x_1+\\cdots+x_n\\right)^2}+ \\frac{x_2}{\\left.1+x_2+\\cdots+x_n\\right)^2}+\\cdots+\\frac{x_n}{\\left(1+x_n\\right)^2}$ 的最大值 $m_n$ (其中 $x_i \\geqslant 0$ ). 用 $m_{n-1}$ 表宗 $m_n$, 并求 $\\lim _{n \\rightarrow \\infty} m_n$.",5 "solution": "分析:$f_n$ 的每一项分母都很复杂, 自然应先作代换将其简化.\n解令 $a_i=\\frac{1}{1+x_i+\\cdots+x_n}, 1 \\leqslant i \\leqslant n$, 并约定 $a_{n+1}=1$. 则\n$$\n\\begin{gathered}\n1+x_i+x_{i+1}+\\cdots+x_n=\\frac{1}{a_i} . \\\\\n1+x_{i+1}+x_{i+2}+\\cdots+x_n=\\frac{1}{a_{i+1}}, \\\\\nx_i=\\frac{1}{a_i}-\\frac{1}{a_{i+1}} . \\\\\nf_n=\\sum_{i=1}^n a_i^2\\left(\\frac{1}{a_i}-\\frac{1}{a_{i+1}}\\right)=\\sum_{i=1}^n\\left(a_i-\\frac{a_i^2}{a_{i+1}}\\right) \\\\\n=\\left(a_1+a_2+\\cdots+a_n\\right)-\\left(\\frac{a_1^2}{a_2}+\\frac{a_2^2}{a_3}+\\cdots+\\frac{a_n^2}{1}\\right) .\n\\end{gathered}\n$$\n因此\n$$\n\\begin{aligned}\nf_n & =\\sum_{i=1}^n a_i^2\\left(\\frac{1}{a_i}-\\frac{1}{a_{i+1}}\\right)=\\sum_{i=1}^n\\left(a_i-\\frac{a_i^2}{a_{i+1}}\\right) \\\\\n& =\\left(a_1+a_2+\\cdots+a_n\\right)-\\left(\\frac{a_1^2}{a_2}+\\frac{a_2^2}{a_3}+\\cdots+\\frac{a_n^2}{1}\\right) .\n\\end{aligned}\n$$\n为求 $f_n$ 之最大值, 构造下列不等式:\n$$\n\\left\\{\\begin{array}{l}\n\\frac{a_1^2}{a_2}+\\lambda_1^2 a_2 \\geqslant 2 \\lambda_1 a_1, \\\\\n\\frac{a_2^2}{a_3}+\\lambda_2^2 a_3 \\geqslant 2 \\lambda_2 a_2, \\\\\n\\cdots \\cdots \\cdots \\cdots \\cdots \\cdots \\cdots \\cdots . . . \\cdots \\cdots \\cdots . . . \\\\\n\\frac{a_n^2}{1}+\\lambda_n^2 \\geqslant 2 \\lambda_n a_n .\n\\end{array}\\right. \\label{(1)}\n$$\n其中 $\\lambda_1, \\lambda_2, \\cdots, \\lambda_n$ 为参数, $\\lambda_i \\geqslant 0$.\n将(1)中 $n$ 个不等式相加, 只须使\n$$\n\\left\\{\\begin{array}{l}\n2 \\lambda_1=1 \\\\\n2 \\lambda_2=1+\\lambda_1^2 \\\\\n\\cdots \\cdots \\cdots \\cdots \\cdots \\cdots \\\\\n2 \\lambda_n=1+\\lambda_{n-1}^2\n\\end{array}\\right. \\label{(2)}\n$$\n即有 $f_n \\leqslant \\lambda_n^2$.\n注意到 $\\lambda_i \\geqslant \\lambda_{i-1}$, 且 $0 \\leqslant \\lambda_i \\leqslant 1$, 故 $\\lim _{n \\rightarrow \\infty} \\lambda_n$ 存在, 易见它的值为 1 .",6 "remark": "",7 "figures": []8}