{"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":"81d8d547-d3c8-525f-a604-ca419e5d2002","task_key":"test--81d8d547-d3c8-525f-a604-ca419e5d2002","task_revision_id":"1","upstream_id":"","short_description":"We randomly choose a function $f:[n] \\rightarrow[n]$, out of the $n^{n}$…","config":"","split":"test","body":"{\"problem\":\"We randomly choose a function $f:[n] \\\\rightarrow[n]$, out of the $n^{n}$ possible functions. We also choose an integer $a$ uniformly at random from $[n]$. Find the probability that there exist positive integers $b, c \\\\geq 1$ such that $f^{b}(1)=a$ and $f^{c}(a)=1$. $\\\\left(f^{k}(x)\\\\right.$ denotes the result of applying $f$ to $x k$ times).\"}","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":[]}