{"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":"e45f7b46-2536-56fe-b54f-ddc24a66e975","task_key":"test--e45f7b46-2536-56fe-b54f-ddc24a66e975","task_revision_id":"1","upstream_id":"","short_description":"Let $m$ be a fixed positive integer. The infinite sequence $\\{a_n\\}_{n\\geq 1}$…","config":"","split":"test","body":"{\"problem\":\"Let $m$ be a fixed positive integer. The infinite sequence $\\\\{a_n\\\\}_{n\\\\geq 1}$ is defined in the following way: $a_1$ is a positive integer, and for every integer $n\\\\geq 1$ we have\\n$$a_{n+1} = \\\\begin{cases}a_n^2+2^m & \\\\text{if } a_n< 2^m \\\\\\\\ a_n/2 &\\\\text{if } a_n\\\\geq 2^m\\\\end{cases}$$\\nFor each $m$, determine all possible values of $a_1$ such that every term in the sequence is an integer.\"}","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":[]}