{"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":"6c77743f-8511-5b16-ba56-5c5e3677e455","task_key":"test--6c77743f-8511-5b16-ba56-5c5e3677e455","task_revision_id":"1","upstream_id":"","short_description":"Let $p\\geq 3$ be a prime number and $0\\leq r\\leq p-3.$ Let…","config":"","split":"test","body":"{\"problem\":\"Let $p\\\\geq 3$ be a prime number and $0\\\\leq r\\\\leq p-3.$ Let $x_1,x_2,\\\\ldots,x_{p-1+r}$ be integers satisfying \\\\[\\\\sum_{i=1}^{p-1+r}x_i^k\\\\equiv r \\\\bmod{p}\\\\]for all $1\\\\leq k\\\\leq p-2.$ What are the possible remainders of numbers $x_2,x_2,\\\\ldots,x_{p-1+r}$ modulo $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":[]}