{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"d81438e5-b165-5763-9e51-793d47569ecb","task_key":"test--d81438e5-b165-5763-9e51-793d47569ecb","task_revision_id":"4","upstream_id":"","short_description":"Let $S$ be a set, $|S|=35$. A set $F$ of mappings from $S$ to itself is called…","config":"","split":"test","body":"{\"problem\":\"Let $S$ be a set, $|S|=35$. A set $F$ of mappings from $S$ to itself is called to be satisfying property $P(k)$, if for any $x,y\\\\in S$, there exist $f_1, \\\\cdots, f_k \\\\in F$ (not necessarily different), such that $f_k(f_{k-1}(\\\\cdots (f_1(x))))=f_k(f_{k-1}(\\\\cdots (f_1(y))))$.\\nFind the least positive integer $m$, such that if $F$ satisfies property $P(2019)$, then it also satisfies property $P(m)$.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}