{"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":"b4b9399d-1f56-5fb3-9f7c-ffb41c34fb32","task_key":"test--b4b9399d-1f56-5fb3-9f7c-ffb41c34fb32","task_revision_id":"1","upstream_id":"","short_description":"For any odd positive integer $n$, let $r(n)$ be the odd positive integer such…","config":"","split":"test","body":"{\"problem\":\"For any odd positive integer $n$, let $r(n)$ be the odd positive integer such that the binary representation of $r(n)$ is the binary representation of $n$ written backwards. For example, $r(2023)=r\\\\left(11111100111_{2}\\\\right)=11100111111_{2}=1855$. Determine, with proof, whether there exists a strictly increasing eight-term arithmetic progression $a_{1}, \\\\ldots, a_{8}$ of odd positive integers such that $r\\\\left(a_{1}\\\\right), \\\\ldots, r\\\\left(a_{8}\\\\right)$ is an arithmetic progression in that order.\"}","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":[]}