{"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":"8b36cc32-276a-5637-ada0-2d23a8424c22","task_key":"test--8b36cc32-276a-5637-ada0-2d23a8424c22","task_revision_id":"1","upstream_id":"","short_description":"For integral $m$, let $p(m)$ be the greatest prime divisor of $m.$ By…","config":"","split":"test","body":"{\"problem\":\"For integral $m$, let $p(m)$ be the greatest prime divisor of $m.$ By convention, we set $p(\\\\pm 1) = 1$ and $p(0) = \\\\infty.$ Find all polynomials $f$ with integer coefficients such that the sequence\\n\\\\[ \\\\{p \\\\left( f \\\\left( n^2 \\\\right) \\\\right) - 2n \\\\}_{n \\\\geq 0}  \\\\] is bounded above. (In particular, this requires $f \\\\left (n^2 \\\\right ) \\\\neq 0$ for $n \\\\geq 0.$)\"}","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":[]}