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

rootprocessed_datasetcalculation0432.json

0432.json8 linesDownload Raw Back to calculation

1{2    "source_file": "./raw_volume-zh/volume14/exercise14.tex",3    "problem_type": "calculation",4    "problem": "问题1. 一张 $8 \\times 8$ 的方格表切去对角两个方格, 这个缺角的方格表能否用 31 张 $2 \\times 1$ 的骨牌覆盖?",5    "solution": "答案是不能把这个残缺的方格表盖住.\n事实上, 把 $8 \\times 8$ 的方格表按国际象棋棋盘黑白染色, 每张骨牌盖住一个黑格和一个白格.\n若有能够盖住棋盘的方法, 他们将盖住 31 个黑格和 31 个白格.\n但缺角方格表上 30 个格子是一种颜色的, 32 个格子是另一种颜色的.",6    "remark": "",7    "figures": []8}