{"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":"36fd56bb-eccf-58c1-af58-bebb73356c9e","task_key":"test--36fd56bb-eccf-58c1-af58-bebb73356c9e","task_revision_id":"1","upstream_id":"","short_description":"Let $n$ be an integer greater than $1$. For a positive integer $m$, let $S_{m}=…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be an integer greater than $1$. For a positive integer $m$, let $S_{m}= \\\\{ 1,2,\\\\ldots, mn\\\\}$. Suppose that there exists a $2n$-element set $T$ such that\\r\\n(a) each element of $T$ is an $m$-element subset of $S_{m}$;\\r\\n(b) each pair of elements of $T$ shares at most one common element;\\r\\nand\\r\\n(c) each element of $S_{m}$ is contained in exactly two elements of $T$.\\r\\n\\r\\nDetermine the maximum possible value of $m$ in terms of $n$.\"}","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":[]}