{"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":"2cb0a2fd-5bcd-5d16-a809-0803f9245c32","task_key":"test--2cb0a2fd-5bcd-5d16-a809-0803f9245c32","task_revision_id":"1","upstream_id":"","short_description":"Determine all functions $f$ defined on the set of all positive integers and…","config":"","split":"test","body":"{\"problem\":\"Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions:\\n[list]\\n[*] $(i)$ $f(n) \\\\neq 0$ for at least one $n$;\\n[*] $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$;\\n[*] $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$.\\n[/list]\"}","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":[]}