{"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":"4a80dc74-9210-5533-b972-df2458ba3da7","task_key":"test--4a80dc74-9210-5533-b972-df2458ba3da7","task_revision_id":"1","upstream_id":"","short_description":"Given a permutation $\\sigma$ of $\\{1,2, \\ldots, 2013\\}$, let $f(\\sigma)$ to be…","config":"","split":"test","body":"{\"problem\":\"Given a permutation $\\\\sigma$ of $\\\\{1,2, \\\\ldots, 2013\\\\}$, let $f(\\\\sigma)$ to be the number of fixed points of $\\\\sigma$ - that is, the number of $k \\\\in\\\\{1,2, \\\\ldots, 2013\\\\}$ such that $\\\\sigma(k)=k$. If $S$ is the set of all possible permutations $\\\\sigma$, compute $$\\\\sum_{\\\\sigma \\\\in S} f(\\\\sigma)^{4}$$ (Here, a permutation $\\\\sigma$ is a bijective mapping from $\\\\{1,2, \\\\ldots, 2013\\\\}$ to $\\\\{1,2, \\\\ldots, 2013\\\\}$.)\"}","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":[]}