{"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":"1d7c8403-db88-5d4a-9e9f-e11a05203a61","task_key":"test--1d7c8403-db88-5d4a-9e9f-e11a05203a61","task_revision_id":"1","upstream_id":"","short_description":"The number 3003 is the only number known to appear eight times in Pascal's…","config":"","split":"test","body":"{\"problem\":\"The number 3003 is the only number known to appear eight times in Pascal's triangle, at positions $\\\\binom{3003}{1},\\\\binom{3003}{3002},\\\\binom{a}{2},\\\\binom{a}{a-2},\\\\binom{15}{b},\\\\binom{15}{15-b},\\\\binom{14}{6},\\\\binom{14}{8}$. Compute $a+b(15-b)$.\"}","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":[]}