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/volume1/exercise5.tex",3 "problem_type": "calculation",4 "problem": "问题5 在集合 $\\{1,2, \\cdots, n\\}$ 中, 任意取出一个子集, 计算它的元素之和.\n问所有子集元素之和的总和是多少?",5 "solution": "$\\{1,2, \\cdots, n\\}$ 中含 $k(1 \\leqslant k \\leqslant n)$ 的子集有 $2^{n-1}$ 个, 故其总和为 $2^{n-1}(1+2+\\cdots+n)=2^{n-2} n(n+1)$.",6 "remark": "",7 "figures": []8}