{"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":"0872e0f0-0789-5967-8136-c252fdbe84e8","task_key":"test--0872e0f0-0789-5967-8136-c252fdbe84e8","task_revision_id":"1","upstream_id":"","short_description":"At a recent math contest, Evan was asked to find $2^{2016}(\\bmod p)$ for a given…","config":"","split":"test","body":"{\"problem\":\"At a recent math contest, Evan was asked to find $2^{2016}(\\\\bmod p)$ for a given prime number $p$ with $100<p<500$. Evan has forgotten what the prime $p$ was, but still remembers how he solved it: - Evan first tried taking 2016 modulo $p-1$, but got a value $e$ larger than 100. - However, Evan noted that $e-\\\\frac{1}{2}(p-1)=21$, and then realized the answer was $-2^{21}(\\\\bmod p)$. What was the prime $p$?\"}","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":[]}