{"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":"8873ed5e-3042-50a5-be86-98d38be80aea","task_key":"test--8873ed5e-3042-50a5-be86-98d38be80aea","task_revision_id":"3","upstream_id":"","short_description":"Find all integers $n \\ge 2$ for which there exists an integer $m$ and a…","config":"","split":"test","body":"{\"problem\":\"Find all integers $n \\\\ge 2$ for which there exists an integer $m$ and a polynomial $P(x)$ with integer coefficients satisfying the following three conditions: [list] \\t[*]$m > 1$ and $\\\\gcd(m,n) = 1$; \\t[*]the numbers $P(0)$, $P^2(0)$, $\\\\ldots$, $P^{m-1}(0)$ \\t\\tare not divisible by $n$; and \\t[*]$P^m(0)$ is divisible by $n$. [/list] Here $P^k$ means $P$ applied $k$ times, so $P^1(0) = P(0)$, $P^2(0) = P(P(0))$, etc.\\n\\n[i]Carl Schildkraut[/i]\"}","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":[]}