{"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":"0cf367a8-372a-5bee-8aef-93915567f195","task_key":"test--0cf367a8-372a-5bee-8aef-93915567f195","task_revision_id":"1","upstream_id":"","short_description":"Find $\\log _{n}\\left(\\frac{1}{2}\\right) \\log _{n-1}\\left(\\frac{1}{3}\\right)…","config":"","split":"test","body":"{\"problem\":\"Find $\\\\log _{n}\\\\left(\\\\frac{1}{2}\\\\right) \\\\log _{n-1}\\\\left(\\\\frac{1}{3}\\\\right) \\\\cdots \\\\log _{2}\\\\left(\\\\frac{1}{n}\\\\right)$ in terms of $n$.\"}","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":[]}