{"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":"3e2c8498-8e66-5ea3-ac80-150b0ac26849","task_key":"test--3e2c8498-8e66-5ea3-ac80-150b0ac26849","task_revision_id":"2","upstream_id":"","short_description":"Let $P$ be a polynomial with integer coefficients such that $P(0)=0$ and","config":"","split":"test","body":"{\"problem\":\"Let $P$ be a polynomial with integer coefficients such that $P(0)=0$ and\\n\\\\[\\\\gcd(P(0), P(1), P(2), \\\\ldots ) = 1.\\\\]\\nShow there are infinitely many $n$ such that\\n\\\\[\\\\gcd(P(n)- P(0), P(n+1)-P(1), P(n+2)-P(2), \\\\ldots) = n.\\\\]\"}","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":[]}