{"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":"d0a10c10-11f1-5314-b50e-2476c6514524","task_key":"test--d0a10c10-11f1-5314-b50e-2476c6514524","task_revision_id":"1","upstream_id":"","short_description":"The rank of a rational number $q$ is the unique $k$ for which…","config":"","split":"test","body":"{\"problem\":\"The rank of a rational number $q$ is the unique $k$ for which $q=\\\\frac{1}{a_{1}}+\\\\cdots+\\\\frac{1}{a_{k}}$, where each $a_{i}$ is the smallest positive integer such that $q \\\\geq \\\\frac{1}{a_{1}}+\\\\cdots+\\\\frac{1}{a_{i}}$. Let $q$ be the largest rational number less than \\\\frac{1}{4}$ with rank 3, and suppose the expression for $q$ is \\\\frac{1}{a_{1}}+\\\\frac{1}{a_{2}}+\\\\frac{1}{a_{3}}$. Find the ordered triple \\\\left(a_{1}, a_{2}, a_{3}\\\\right).\"}","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":[]}