{"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":"420acef3-187f-52e3-a936-3ec14907f2e7","task_key":"test--420acef3-187f-52e3-a936-3ec14907f2e7","task_revision_id":"1","upstream_id":"","short_description":"Let $n$ be a positive integer. Compute the number of words $w$ that satisfy the…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be a positive integer. Compute the number of words $w$ that satisfy the following three properties.\\n\\n1. $w$ consists of $n$ letters from the alphabet $\\\\{a,b,c,d\\\\}.$\\n\\n2. $w$ contains an even number of $a$'s\\n\\n3. $w$ contains an even number of $b$'s.\\n\\nFor example, for $n=2$ there are $6$ such words: $aa, bb, cc, dd, cd, dc.$\"}","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":[]}