{"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":"e155ca26-f068-5d4f-9e3d-7650b76e9136","task_key":"test--e155ca26-f068-5d4f-9e3d-7650b76e9136","task_revision_id":"1","upstream_id":"","short_description":"Let $\\lfloor x\\rfloor$ denote the largest integer less than or equal to $x$, and…","config":"","split":"test","body":"{\"problem\":\"Let $\\\\lfloor x\\\\rfloor$ denote the largest integer less than or equal to $x$, and let $\\\\{x\\\\}$ denote the fractional part of $x$. For example, $\\\\lfloor\\\\pi\\\\rfloor=3$, and $\\\\{\\\\pi\\\\}=0.14159 \\\\ldots$, while $\\\\lfloor 100\\\\rfloor=100$ and $\\\\{100\\\\}=0$. If $n$ is the largest solution to the equation $\\\\frac{\\\\lfloor n\\\\rfloor}{n}=\\\\frac{2015}{2016}$, compute $\\\\{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":[]}