{"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":"cd478530-6803-54e4-9ba6-cfb33f2d27d1","task_key":"test--cd478530-6803-54e4-9ba6-cfb33f2d27d1","task_revision_id":"1","upstream_id":"","short_description":"Calculate $\\displaystyle \\sum_{n=1}^\\infty \\ln \\left(1+\\frac{1}{n}\\right)…","config":"","split":"test","body":"{\"problem\":\"Calculate $\\\\displaystyle \\\\sum_{n=1}^\\\\infty \\\\ln \\\\left(1+\\\\frac{1}{n}\\\\right) \\\\ln\\\\left( 1+\\\\frac{1}{2n}\\\\right)\\\\ln\\\\left( 1+\\\\frac{1}{2n+1}\\\\right)$.\"}","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":[]}