{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"c35a3d48-a65f-58a9-989d-975cd8e2785f","task_key":"test--c35a3d48-a65f-58a9-989d-975cd8e2785f","task_revision_id":"4","upstream_id":"","short_description":"Let $m>1$ be an integer. Find the smallest positive integer $n$, such that for…","config":"","split":"test","body":"{\"problem\":\"Let $m>1$ be an integer. Find the smallest positive integer $n$, such that for any integers $a_1,a_2,\\\\ldots ,a_n; b_1,b_2,\\\\ldots ,b_n$ there exists integers $x_1,x_2,\\\\ldots ,x_n$ satisfying the following two conditions: \\n\\ni) There exists $i\\\\in \\\\{1,2,\\\\ldots ,n\\\\}$ such that $x_i$ and $m$ are coprime\\n\\nii) $\\\\sum^n_{i=1} a_ix_i \\\\equiv \\\\sum^n_{i=1} b_ix_i \\\\equiv 0 \\\\pmod m$\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}