{"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":"27730c2e-5b87-50fc-b566-2d465532525f","task_key":"test--27730c2e-5b87-50fc-b566-2d465532525f","task_revision_id":"1","upstream_id":"","short_description":"For any integer $n$, define $\\lfloor n\\rfloor$ as the greatest integer less than…","config":"","split":"test","body":"{\"problem\":\"For any integer $n$, define $\\\\lfloor n\\\\rfloor$ as the greatest integer less than or equal to $n$. For any positive integer $n$, let $$f(n)=\\\\lfloor n\\\\rfloor+\\\\left\\\\lfloor\\\\frac{n}{2}\\\\right\\\\rfloor+\\\\left\\\\lfloor\\\\frac{n}{3}\\\\right\\\\rfloor+\\\\cdots+\\\\left\\\\lfloor\\\\frac{n}{n}\\\\right\\\\rfloor.$$ For how many values of $n, 1 \\\\leq n \\\\leq 100$, is $f(n)$ odd?\"}","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":[]}