{"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":"c3b1904b-6774-5e4a-8f7d-00206d19f3ec","task_key":"test--c3b1904b-6774-5e4a-8f7d-00206d19f3ec","task_revision_id":"1","upstream_id":"","short_description":"A polynomial $f \\in \\mathbb{Z}[x]$ is called splitty if and only if for every…","config":"","split":"test","body":"{\"problem\":\"A polynomial $f \\\\in \\\\mathbb{Z}[x]$ is called splitty if and only if for every prime $p$, there exist polynomials $g_{p}, h_{p} \\\\in \\\\mathbb{Z}[x]$ with $\\\\operatorname{deg} g_{p}, \\\\operatorname{deg} h_{p}<\\\\operatorname{deg} f$ and all coefficients of $f-g_{p} h_{p}$ are divisible by $p$. Compute the sum of all positive integers $n \\\\leq 100$ such that the polynomial $x^{4}+16 x^{2}+n$ is splitty.\"}","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":[]}