{"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":"8842116b-8aa6-5b53-9e81-5b4480d2d81f","task_key":"test--8842116b-8aa6-5b53-9e81-5b4480d2d81f","task_revision_id":"1","upstream_id":"","short_description":"Let $\\omega_{1}, \\omega_{2}, \\ldots, \\omega_{100}$ be the roots of…","config":"","split":"test","body":"{\"problem\":\"Let $\\\\omega_{1}, \\\\omega_{2}, \\\\ldots, \\\\omega_{100}$ be the roots of $\\\\frac{x^{101}-1}{x-1}$ (in some order). Consider the set $S=\\\\left\\\\{\\\\omega_{1}^{1}, \\\\omega_{2}^{2}, \\\\omega_{3}^{3}, \\\\ldots, \\\\omega_{100}^{100}\\\\right\\\\}$. Let $M$ be the maximum possible number of unique values in $S$, and let $N$ be the minimum possible number of unique values in $S$. Find $M-N$.\"}","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":[]}