{"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":"ab64f480-55a2-598e-bfbc-9c3a650b5776","task_key":"test--ab64f480-55a2-598e-bfbc-9c3a650b5776","task_revision_id":"1","upstream_id":"","short_description":"Define $f: \\mathbb{R} \\to \\mathbb{R}$ by","config":"","split":"test","body":"{\"problem\":\"Define $f: \\\\mathbb{R} \\\\to \\\\mathbb{R}$ by\\n\\\\[\\nf(x) = \\\\begin{cases} x & \\\\mbox{if $x \\\\leq e$} \\\\\\\\ x f(\\\\ln x) &\\n\\\\mbox{if $x > e$.} \\\\end{cases}\\n\\\\]\\nDoes $\\\\sum_{n=1}^\\\\infty \\\\frac{1}{f(n)}$ converge?\"}","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":[]}