{"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":"e00cc56f-d7fc-5b70-bb90-39db25f2872f","task_key":"test--e00cc56f-d7fc-5b70-bb90-39db25f2872f","task_revision_id":"1","upstream_id":"","short_description":"Let $m$ be a fixed integer greater than $1$. The sequence $x_0$, $x_1$, $x_2$,…","config":"","split":"test","body":"{\"problem\":\"Let $m$ be a fixed integer greater than $1$. The sequence $x_0$, $x_1$, $x_2$, $\\\\ldots$ is defined as follows: \\n\\\\[x_i = \\\\begin{cases}2^i&\\\\text{if }0\\\\leq i \\\\leq m - 1;\\\\\\\\\\\\sum_{j=1}^mx_{i-j}&\\\\text{if }i\\\\geq m.\\\\end{cases}\\\\]\\nFind the greatest $k$ for which the sequence contains $k$ consecutive terms divisible by $m$ .\\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":[]}