{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"omni-math","formal_name":"Omni-MATH","introduction":"Omni-MATH evaluates mathematical reasoning on Olympiad-level problems. Its official dataset contains 4,428 problems accompanied by domain and difficulty information.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"6fd28484-7de1-5ee9-afb1-067f80120ba9","task_key":"test--6fd28484-7de1-5ee9-afb1-067f80120ba9","task_revision_id":"1","upstream_id":"","short_description":"Call a rational number [i]short[/i] if it has finitely many digits in its…","config":"","split":"test","body":"{\"problem\":\"Call a rational number [i]short[/i] if it has finitely many digits in its decimal expansion. For a positive integer $m$, we say that a positive integer $t$ is $m-$[i]tastic[/i] if there exists a number $c\\\\in \\\\{1,2,3,\\\\ldots ,2017\\\\}$ such that $\\\\dfrac{10^t-1}{c\\\\cdot m}$ is short, and such that $\\\\dfrac{10^k-1}{c\\\\cdot m}$ is not short for any $1\\\\le k<t$. Let $S(m)$ be the set of $m-$tastic numbers. Consider $S(m)$ for $m=1,2,\\\\ldots{}.$ What is the maximum number of elements in $S(m)$?\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}