{"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":"0df4a414-9e25-560f-88d1-6b6ea6edc3e2","task_key":"test--0df4a414-9e25-560f-88d1-6b6ea6edc3e2","task_revision_id":"1","upstream_id":"","short_description":"Given a positive integer $n$, let $M(n)$ be the largest integer $m$ such that \\[…","config":"","split":"test","body":"{\"problem\":\"Given a positive integer $n$, let $M(n)$ be the largest integer $m$ such that \\\\[ \\\\binom{m}{n-1} > \\\\binom{m-1}{n}. \\\\] Evaluate \\\\[ \\\\lim_{n \\\\to \\\\infty} \\\\frac{M(n)}{n}. \\\\]\"}","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":[]}