{"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":"5d28546f-5ee8-5ed6-9c46-043e2af3e15c","task_key":"test--5d28546f-5ee8-5ed6-9c46-043e2af3e15c","task_revision_id":"1","upstream_id":"","short_description":"Consider sequences \\(a\\) of the form \\(a=\\left(a_{1}, a_{2}, \\ldots,…","config":"","split":"test","body":"{\"problem\":\"Consider sequences \\\\(a\\\\) of the form \\\\(a=\\\\left(a_{1}, a_{2}, \\\\ldots, a_{20}\\\\right)\\\\) such that each term \\\\(a_{i}\\\\) is either 0 or 1. For each such sequence \\\\(a\\\\), we can produce a sequence \\\\(b=\\\\left(b_{1}, b_{2}, \\\\ldots, b_{20}\\\\right)\\\\), where \\\\(b_{i}= \\\\begin{cases}a_{i}+a_{i+1} & i=1 \\\\\\\\ a_{i-1}+a_{i}+a_{i+1} & 1<i<20 \\\\\\\\ a_{i-1}+a_{i} & i=20\\\\end{cases}\\\\). How many sequences \\\\(b\\\\) are there that can be produced by more than one distinct sequence \\\\(a\\\\)?\"}","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":[]}