{"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":"82c62606-796b-5436-9202-0f98c5d219ee","task_key":"test--82c62606-796b-5436-9202-0f98c5d219ee","task_revision_id":"1","upstream_id":"","short_description":"For each integer $n\\ge 1,$ compute the smallest possible value of…","config":"","split":"test","body":"{\"problem\":\"For each integer $n\\\\ge 1,$ compute the smallest possible value of \\\\[\\\\sum_{k=1}^{n}\\\\left\\\\lfloor\\\\frac{a_k}{k}\\\\right\\\\rfloor\\\\] over all permutations $(a_1,\\\\dots,a_n)$ of $\\\\{1,\\\\dots,n\\\\}.$\\n\\n[i]\"}","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":[]}