{"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":"c56f674a-8e6e-5e1d-a0f4-ec1964b25ff4","task_key":"test--c56f674a-8e6e-5e1d-a0f4-ec1964b25ff4","task_revision_id":"1","upstream_id":"","short_description":"A function $f: A \\rightarrow A$ is called idempotent if $f(f(x))=f(x)$ for all…","config":"","split":"test","body":"{\"problem\":\"A function $f: A \\\\rightarrow A$ is called idempotent if $f(f(x))=f(x)$ for all $x \\\\in A$. Let $I_{n}$ be the number of idempotent functions from $\\\\{1,2, \\\\ldots, n\\\\}$ to itself. Compute $\\\\sum_{n=1}^{\\\\infty} \\\\frac{I_{n}}{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":[]}