{"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":"cf89b1f4-dd40-5211-853f-f6886fee40f6","task_key":"test--cf89b1f4-dd40-5211-853f-f6886fee40f6","task_revision_id":"1","upstream_id":"","short_description":"Fix an integer \\(b \\geq 2\\). Let \\(f(1) = 1\\), \\(f(2) = 2\\), and for each \\(n…","config":"","split":"test","body":"{\"problem\":\"Fix an integer \\\\(b \\\\geq 2\\\\). Let \\\\(f(1) = 1\\\\), \\\\(f(2) = 2\\\\), and for each \\\\(n \\\\geq 3\\\\), define \\\\(f(n) = n f(d)\\\\), where \\\\(d\\\\) is the number of base-\\\\(b\\\\) digits of \\\\(n\\\\). For which values of \\\\(b\\\\) does \\\\(\\\\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":[]}