{"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":"f0e20bf3-5601-582a-9980-fe963f4c5356","task_key":"test--f0e20bf3-5601-582a-9980-fe963f4c5356","task_revision_id":"1","upstream_id":"","short_description":"The $2010$ positive numbers $a_1, a_2, \\ldots , a_{2010}$ satisfy","config":"","split":"test","body":"{\"problem\":\"The $2010$ positive numbers $a_1, a_2, \\\\ldots , a_{2010}$ satisfy\\nthe inequality $a_ia_j \\\\le i+j$ for all distinct indices $i, j$ .\\nDetermine, with proof, the largest possible value of the product $a_1a_2\\\\cdots a_{2010}$ .\"}","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":[]}