{"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":"7d267a73-3824-5f5c-b148-08a827edcc6f","task_key":"test--7d267a73-3824-5f5c-b148-08a827edcc6f","task_revision_id":"3","upstream_id":"","short_description":"For a nonempty set $S$ of integers, let $\\sigma(S)$ be the sum of the elements…","config":"","split":"test","body":"{\"problem\":\"For a nonempty set $S$ of integers, let $\\\\sigma(S)$ be the sum of the elements of $S$ . Suppose that $A = \\\\{a_1, a_2, \\\\ldots, a_{11}\\\\}$ is a set of positive integers with $a_1 < a_2 < \\\\cdots < a_{11}$ and that, for each positive integer $n \\\\le 1500$ , there is a subset $S$ of $A$ for which $\\\\sigma(S) = n$ . What is the smallest possible value of $a_{10}$ ?\"}","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":[]}