CoolFace
Datasetpublic

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.

sourceHugging Facecc-by-nd-4.0updated 8mo agoView on Hugging Face
3likes9.7kdownloads
0540.json8 linesDownload Raw Back to calculation
1{2    "source_file": "./raw_volume-zh/volume2/chapter7.tex",3    "problem_type": "calculation",4    "problem": "例7 求满足下列条件的多项式 $f(x, y)$ :\n(1) $f(x, y)$ 对于 $x 、 y$ 是齐次的, 即对任意实数 $t 、 x 、 y$, 若 $f$ 是 $n$ 次的, 则有\n$$\nf(t x, t y)==t^n f(x, y) ;\n$$\n(2) 对任意 $a 、 b 、 c \\in \\mathbf{R}$, 有\n$$\nf(a+b, c)+f(b+c, a)+f(c+a, b)=0 ;\n$$\n(3) $f(1,0)=1$.",5    "solution": "解:在(2) 中令 $a=b=c=x$, 得\n$$\nf(2 x, x)=0 .\n$$\n根据多项式的因式定理,有\n$$\nf(x, y)=(x-2 y) g(x, y) . \\quad\\quad <1>\n$$\n这里 $g(x, y)$ 是 $n-1$ 次齐次多项式.\n再在 (2) 中令 $a=b=x, c=2 y$, 得\n$$\nf(2 x, 2 y)=-2 f(x+2 y, x) .\n$$\n由 $f$ 的齐次性,得\n$$\n2^n f(x, y)=-2 f(x+2 y, x) .\n$$\n将<1>式代入上式, 得\n$$\n2^{n-1} g(x, y)=g(x+2 y, x) . \\quad\\quad <2>\n$$\n由此利用条件(3), 在<1>中令 $x=1, y=0$, 得\n$$\ng(1,0)=1 \\text {. }\n$$\n由<2>式递推,得\n$$\n\\begin{gathered}\ng(1,1)=2^{n-1}, g(3,1)=4^{n-1}, \\\\\ng(5,3)=8^{n-1}, g(11,5)=16^{n-1}, \\cdots,\n\\end{gathered}\n$$\n即存在无限多对 $(x, y)$, 使 $g(x, y)=(x+y)^{n-1}$ 成立, 由多项式恒等定理, 知\n$$\ng(x, y)=(x+y)^{n-1} .\n$$\n所以 $f(x, y)=(x-2 y)(x+y)^{n-1}$.\n经检验, 可知上述的函数满足题中条件.",6    "remark": "",7    "figures": []8}