{"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":"be955210-3f22-5200-9e77-cc741ff716f2","task_key":"test--be955210-3f22-5200-9e77-cc741ff716f2","task_revision_id":"1","upstream_id":"","short_description":"Compute $\\lim _{n \\rightarrow \\infty} \\frac{1}{\\log \\log n}…","config":"","split":"test","body":"{\"problem\":\"Compute $\\\\lim _{n \\\\rightarrow \\\\infty} \\\\frac{1}{\\\\log \\\\log n} \\\\sum_{k=1}^{n}(-1)^{k}\\\\binom{n}{k} \\\\log k$.\"}","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":[]}