{"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":"8dd9be2f-976f-588f-962a-5167bd4ea648","task_key":"test--8dd9be2f-976f-588f-962a-5167bd4ea648","task_revision_id":"1","upstream_id":"","short_description":"Let $p>3$ be a prime and let $a_1,a_2,...,a_{\\frac{p-1}{2}}$ be a permutation of…","config":"","split":"test","body":"{\"problem\":\"Let $p>3$ be a prime and let $a_1,a_2,...,a_{\\\\frac{p-1}{2}}$ be a permutation of $1,2,...,\\\\frac{p-1}{2}$. For which $p$ is it always possible to determine the sequence $a_1,a_2,...,a_{\\\\frac{p-1}{2}}$ if it for all $i,j\\\\in\\\\{1,2,...,\\\\frac{p-1}{2}\\\\}$ with $i\\\\not=j$ the residue of $a_ia_j$ modulo $p$ is known?\"}","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":[]}