{"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":"f56bc5a8-4c0a-5cb0-8da2-d9b88e676276","task_key":"test--f56bc5a8-4c0a-5cb0-8da2-d9b88e676276","task_revision_id":"4","upstream_id":"","short_description":"An integer $n>1$ is given . Find the smallest positive number $m$ satisfying the…","config":"","split":"test","body":"{\"problem\":\"An integer  $n>1$ is given .  Find the smallest positive number $m$ satisfying the following conditions： for any set $\\\\{a,b\\\\}$ $\\\\subset \\\\{1,2,\\\\cdots,2n-1\\\\}$ ,there are non-negative integers   $ x, y$  ( not all zero)  such  that   $2n|ax+by$ and $x+y\\\\leq 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":[]}