{"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":"62650104-ece1-56e4-b045-8f454331ead6","task_key":"test--62650104-ece1-56e4-b045-8f454331ead6","task_revision_id":"1","upstream_id":"","short_description":"For any two different real numbers $x$ and $y$, we define $D(x,y)$ to be the…","config":"","split":"test","body":"{\"problem\":\"For any two different real numbers $x$ and $y$, we define $D(x,y)$ to be the unique integer $d$ satisfying $2^d\\\\le |x-y| < 2^{d+1}$. Given a set of reals $\\\\mathcal F$, and an element $x\\\\in \\\\mathcal F$, we say that the [i]scales[/i] of $x$ in $\\\\mathcal F$ are the values of $D(x,y)$ for $y\\\\in\\\\mathcal F$ with $x\\\\neq y$. Let $k$ be a given positive integer. \\n \\nSuppose that each member $x$ of $\\\\mathcal F$ has at most $k$ different scales in $\\\\mathcal F$ (note that these scales may depend on $x$). What is the maximum possible size of $\\\\mathcal F$?\"}","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":[]}