{"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":"8129941b-ad9f-5f4a-8a89-822a94336d59","task_key":"test--8129941b-ad9f-5f4a-8a89-822a94336d59","task_revision_id":"1","upstream_id":"","short_description":"Given an integer $ m$, define the sequence $ \\left\\{a_{n}\\right\\}$ as follows:","config":"","split":"test","body":"{\"problem\":\"Given an integer $ m$, define the sequence $ \\\\left\\\\{a_{n}\\\\right\\\\}$ as follows:\\n\\\\[ a_{1}\\\\equal{}\\\\frac{m}{2},\\\\ a_{n\\\\plus{}1}\\\\equal{}a_{n}\\\\left\\\\lceil a_{n}\\\\right\\\\rceil,\\\\textnormal{ if }n\\\\geq 1\\\\]\\nFind all values of $ m$ for which $ a_{2007}$ is the first integer appearing in the sequence.\\n\\nNote: For a real number $ x$, $ \\\\left\\\\lceil x\\\\right\\\\rceil$ is defined as the smallest integer greater or equal to $ x$. For example, $ \\\\left\\\\lceil\\\\pi\\\\right\\\\rceil\\\\equal{}4$, $ \\\\left\\\\lceil 2007\\\\right\\\\rceil\\\\equal{}2007$.\"}","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":[]}