{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"05d97329-05a5-5f80-aa88-4d3535e1ffac","task_key":"test--05d97329-05a5-5f80-aa88-4d3535e1ffac","task_revision_id":"2","upstream_id":"","short_description":"Given positive integers $k, m, n$ such that $1 \\leq k \\leq m \\leq n$. Evaluate","config":"","split":"test","body":"{\"problem\":\"Given positive integers $k, m, n$ such that $1 \\\\leq  k \\\\leq  m \\\\leq  n$. Evaluate\\n\\n\\\\[\\\\sum^{n}_{i=0} \\\\frac{(-1)^i}{n+k+i} \\\\cdot \\\\frac{(m+n+i)!}{i!(n-i)!(m+i)!}.\\\\]\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}