{"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":"a787e77c-41a7-5c97-93af-8f76e3d8260e","task_key":"test--a787e77c-41a7-5c97-93af-8f76e3d8260e","task_revision_id":"1","upstream_id":"","short_description":"Let $n > 1$ be an integer. Find, with proof, all sequences $x_1 , x_2 , \\ldots ,…","config":"","split":"test","body":"{\"problem\":\"Let $n > 1$ be an integer. Find, with proof, all sequences $x_1 , x_2 , \\\\ldots , x_{n-1}$ of positive integers with the following three properties: \\n(a). $x_1 < x_2 < \\\\cdots < x_{n-1}$ ; \\n(b). $x_i + x_{n-i} = 2n$ for all $i = 1, 2, \\\\ldots , n - 1$; \\n(c). given any two indices $i$ and $j$ (not necessarily distinct) for which $x_i + x_j < 2n$, there is an index $k$ such that $x_i + x_j = x_k$.\"}","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":[]}