{"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":"f02645e8-d7ab-5cfa-b1ee-2dfb4b23b83d","task_key":"test--f02645e8-d7ab-5cfa-b1ee-2dfb4b23b83d","task_revision_id":"1","upstream_id":"","short_description":"Find the smallest positive integer $n$ such that the polynomial $(x+1)^{n}-1$ is…","config":"","split":"test","body":"{\"problem\":\"Find the smallest positive integer $n$ such that the polynomial $(x+1)^{n}-1$ is \\\"divisible by $x^{2}+1$ modulo 3\\\", or more precisely, either of the following equivalent conditions holds: there exist polynomials $P, Q$ with integer coefficients such that $(x+1)^{n}-1=\\\\left(x^{2}+1\\\\right) P(x)+3 Q(x)$; or more conceptually, the remainder when (the polynomial) $(x+1)^{n}-1$ is divided by (the polynomial) $x^{2}+1$ is a polynomial with (integer) coefficients all divisible by 3.\"}","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":[]}