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.4k
1{2 "source_file": "./raw_volume-zh/volume5/exercise9.tex",3 "problem_type": "calculation",4 "problem": "问题4. 设 $x_1, x_2, \\cdots, x_n$ 是非负实数,且满足:\n$$\n\\sum_{i=1}^n x_i^2+\\sum_{1 \\leqslant i<j \\leqslant n}\\left(x_i x_j\\right)^2=\\frac{n(n+1)}{2} .\n$$\n(1) 求 $\\sum_{i=1}^n x_i$ 的最大值;\n(2)求所有正整数 $n$,使得 $\\sum_{i=1}^n x_i \\geqslant \\sqrt{\\frac{n(n+1)}{2}}$.",5 "solution": "(1) $\\left(\\sum_{i=1}^n x_i\\right)^2=\\sum_{i=1}^n x_i^2+2 \\sum_{1 \\leqslant i<j \\leqslant n} x_i x_j=\\sum_{i=1}^n x_i^2+\\sum_{1 \\leqslant i<j \\leqslant n}\\left(x_i x_j\\right)^2+ \\sum_{1 \\leqslant i<j \\leqslant n}\\left(2 x_i x_j-\\left(x_i x_j\\right)^2\\right) \\leqslant \\frac{n(n+1)}{2}+\\sum_{1 \\leqslant i<j \\leqslant n} 1=n^2$, 故 $\\sum_{i=1}^n x_i \\leqslant n$, 等号在 $x_1=x_2=\\cdots=x_n=1$ 时取到.\n(2)当 $n=1$ 时, $x_1=1$, 满足 $\\sum_{i=1}^n x_i \\geqslant \\sqrt{\\frac{n(n+1)}{2}}$.\n当 $n=2$ 时, 由条件知 $x_1^2+x_2^2+\\left(x_1 x_2\\right)^2=3$, 于是 $x_1 x_2 \\leqslant \\sqrt{3}$, 所以\n$$\n\\left(x_1+x_2\\right)^2=3-x_1^2 x_2^2+2 x_1 x_2=3+x_1 x_2\\left(2-x_1 x_2\\right) \\geqslant 3,\n$$\n故 $x_1+x_2 \\geqslant \\sqrt{3}$, 等号在 $x_1=\\sqrt{3}, x_2=0$ 时取到.\n当 $n=3$ 时, 由题设, $x_1^2+x_2^2+x_3^2+x_1^2 x_2^2+x_2^2 x_3^2+x_3^2 x_1^2=6$.\n若 $\\max \\left\\{x_1 x_2, x_2 x_3, x_3 x_1\\right\\} \\leqslant 2$, 则\n$$\n\\begin{aligned}\n\\left(x_1+x_2+x_3\\right)^2 & =6+x_1 x_2\\left(2-x_1 x_2\\right)+x_2 x_3\\left(2-x_2 x_3\\right)+x_3 x_1\\left(2-x_3 x_1\\right) \\\\\n& \\geqslant 6 .\n\\end{aligned}\n$$\n若 $\\max \\left\\{x_1 x_2, x_2 x_3, x_3 x_1\\right\\}>2$, 不妨设 $x_1 x_2>2$, 则\n$$\nx_1+x_2+x_3 \\geqslant x_1+x_2 \\geqslant 2 \\sqrt{x_1 x_2}>2 \\sqrt{2}>\\sqrt{6} .\n$$\n当 $n \\geqslant 4$ 时,令 $x_1=x_2=x, x_3=x_4=\\cdots=x_n=0$.\n则 $2 x^2+x^4=\\frac{n(n+1)}{2}$, 故 $x= \\pm \\sqrt{\\frac{\\sqrt{2 n(n+1)+4}-2}{2}}$ (负的舍去).\n此时, $\\sum_{i=1}^n x_i=\\sqrt{2 \\sqrt{2 n(n+1)+4}-4}<\\sqrt{\\frac{1}{2} n(n+1)}$.\n综上所述, 所求的正整数 $n=1,2$ 或 3 .",6 "remark": "",7 "figures": []8}