{"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":"07912873-495b-5c4e-81e1-8a22bf92f78c","task_key":"test--07912873-495b-5c4e-81e1-8a22bf92f78c","task_revision_id":"1","upstream_id":"","short_description":"In a town every two residents who are not friends have a friend in common, and…","config":"","split":"test","body":"{\"problem\":\"In a town every two residents who are not friends have a friend in common, and no one is a friend of everyone else. Let us number the residents from 1 to $n$ and let $a_{i}$ be the number of friends of the $i$-th resident. Suppose that $\\\\sum_{i=1}^{n} a_{i}^{2}=n^{2}-n$. Let $k$ be the smallest number of residents (at least three) who can be seated at a round table in such a way that any two neighbors are friends. Determine all possible values of $k$.\"}","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":[]}