{"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":"77f93a0e-9e1f-523f-a916-2f9f6d1fa23e","task_key":"test--77f93a0e-9e1f-523f-a916-2f9f6d1fa23e","task_revision_id":"1","upstream_id":"","short_description":"Let $a_{1}, a_{2}, \\ldots, a_{n}$ be a sequence of distinct positive integers…","config":"","split":"test","body":"{\"problem\":\"Let $a_{1}, a_{2}, \\\\ldots, a_{n}$ be a sequence of distinct positive integers such that $a_{1}+a_{2}+\\\\cdots+a_{n}=2021$ and $a_{1} a_{2} \\\\cdots a_{n}$ is maximized. If $M=a_{1} a_{2} \\\\cdots a_{n}$, compute the largest positive integer $k$ such that $2^{k} \\\\mid M$.\"}","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":[]}