{"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":"bb5bbf05-7a13-5e3a-9d27-540c8c16dcca","task_key":"test--bb5bbf05-7a13-5e3a-9d27-540c8c16dcca","task_revision_id":"1","upstream_id":"","short_description":"At a conference there are $n$ mathematicians. Each of them knows exactly $k$…","config":"","split":"test","body":"{\"problem\":\"At a conference there are $n$ mathematicians. Each of them knows exactly $k$ fellow mathematicians. Find the smallest value of $k$ such that there are at least three mathematicians that are acquainted each with the other two.\\n\\n[color=#BF0000]Rewording of the last line for clarification:[/color]\\nFind the smallest value of $k$ such that there (always) exists $3$ mathematicians $X,Y,Z$ such that $X$ and $Y$ know each other, $X$ and $Z$ know each other and $Y$ and $Z$ know each other.\"}","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":[]}