{"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":"85f32d9e-31f9-5ae0-8ef9-1aab826c22b4","task_key":"test--85f32d9e-31f9-5ae0-8ef9-1aab826c22b4","task_revision_id":"1","upstream_id":"","short_description":"Find all positive integers $n$ such that the following statement holds: Suppose…","config":"","split":"test","body":"{\"problem\":\"Find all positive integers $n$ such that the following statement holds: Suppose real numbers $a_1$, $a_2$, $\\\\dots$, $a_n$, $b_1$, $b_2$, $\\\\dots$, $b_n$ satisfy $|a_k|+|b_k|=1$ for all $k=1,\\\\dots,n$. Then there exists $\\\\varepsilon_1$, $\\\\varepsilon_2$, $\\\\dots$, $\\\\varepsilon_n$, each of which is either $-1$ or $1$, such that\\n    \\\\[ \\\\left| \\\\sum_{i=1}^n \\\\varepsilon_i a_i \\\\right| + \\\\left| \\\\sum_{i=1}^n \\\\varepsilon_i b_i \\\\right| \\\\le 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":[]}