{"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":"d6b4b3b9-1a30-508f-a5f9-103c9132c929","task_key":"test--d6b4b3b9-1a30-508f-a5f9-103c9132c929","task_revision_id":"1","upstream_id":"","short_description":"Find all odd positive integers $n>1$ such that there is a permutation $a_{1},…","config":"","split":"test","body":"{\"problem\":\"Find all odd positive integers $n>1$ such that there is a permutation $a_{1}, a_{2}, \\\\ldots, a_{n}$ of the numbers $1,2, \\\\ldots, n$, where $n$ divides one of the numbers $a_{k}^{2}-a_{k+1}-1$ and $a_{k}^{2}-a_{k+1}+1$ for each $k, 1 \\\\leq k \\\\leq n$ (we assume $a_{n+1}=a_{1}$ ).\"}","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":[]}