{"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":"77fafa2c-0c53-5f5b-95ec-4cf17b60d04d","task_key":"test--77fafa2c-0c53-5f5b-95ec-4cf17b60d04d","task_revision_id":"1","upstream_id":"","short_description":"Let $p$ be an odd prime number, and let $\\mathbb{F}_p$ denote the field of…","config":"","split":"test","body":"{\"problem\":\"Let $p$ be an odd prime number, and let $\\\\mathbb{F}_p$ denote the field of integers modulo $p$. Let $\\\\mathbb{F}_p[x]$ be the ring of polynomials over $\\\\mathbb{F}_p$, and let $q(x) \\\\in \\\\mathbb{F}_p[x]$ be given by \\\\[ q(x) = \\\\sum_{k=1}^{p-1} a_k x^k, \\\\] where \\\\[ a_k = k^{(p-1)/2} \\\\mod{p}. \\\\] Find the greatest nonnegative integer $n$ such that $(x-1)^n$ divides $q(x)$ in $\\\\mathbb{F}_p[x]$.\"}","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":[]}