{"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":"73bf1900-5108-58bf-b96c-ffbae6890cb2","task_key":"test--73bf1900-5108-58bf-b96c-ffbae6890cb2","task_revision_id":"1","upstream_id":"","short_description":"Find all surjective functions $ f: \\mathbb{N} \\to \\mathbb{N}$ such that for…","config":"","split":"test","body":"{\"problem\":\"Find all surjective functions $ f: \\\\mathbb{N} \\\\to \\\\mathbb{N}$ such that for every $ m,n \\\\in \\\\mathbb{N}$ and every prime $ p,$ the number $ f(m + n)$ is divisible by $ p$ if and only if $ f(m) + f(n)$ is divisible by $ p$.\\n\\n[i]Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran[/i]\"}","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":[]}