{"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":"63d2ea9e-4eb6-5a3b-9ab9-b2e94028d256","task_key":"test--63d2ea9e-4eb6-5a3b-9ab9-b2e94028d256","task_revision_id":"1","upstream_id":"","short_description":"For each positive integer $k,$ let $t(k)$ be the largest odd divisor of $k.$…","config":"","split":"test","body":"{\"problem\":\"For each positive integer $k,$ let $t(k)$ be the largest odd divisor of $k.$ Determine all positive integers $a$ for which there exists a positive integer $n,$ such that all the differences\\n\\n\\\\[t(n+a)-t(n); t(n+a+1)-t(n+1), \\\\ldots, t(n+2a-1)-t(n+a-1)\\\\] are divisible by 4.\\n\\n[i]\"}","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":[]}