{"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":"8132e283-a4c2-5526-b045-0cade40f0200","task_key":"test--8132e283-a4c2-5526-b045-0cade40f0200","task_revision_id":"1","upstream_id":"","short_description":"Compute, in terms of $n$, $\\sum_{k=0}^{n}\\binom{n-k}{k} 2^{k}$.","config":"","split":"test","body":"{\"problem\":\"Compute, in terms of $n$, $\\\\sum_{k=0}^{n}\\\\binom{n-k}{k} 2^{k}$.\"}","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":[]}