{"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":"998b4925-18f7-5cde-a598-895cee621a7a","task_key":"test--998b4925-18f7-5cde-a598-895cee621a7a","task_revision_id":"1","upstream_id":"","short_description":"Find all positive integers $n$ for which there exists a polynomial $P(x) \\in…","config":"","split":"test","body":"{\"problem\":\"Find all positive integers $n$ for which there exists a polynomial $P(x) \\\\in \\\\mathbb{Z}[x]$ such that for every positive integer $m\\\\geq 1$, the numbers $P^m(1), \\\\ldots, P^m(n)$ leave exactly $\\\\lceil n/2^m\\\\rceil$ distinct remainders when divided by $n$. (Here, $P^m$ means $P$ applied $m$ times.)\\n\\n[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":[]}