{"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":"065bf0e8-0efa-51a0-ad50-ea62c4ff89a9","task_key":"test--065bf0e8-0efa-51a0-ad50-ea62c4ff89a9","task_revision_id":"1","upstream_id":"","short_description":"For each positive integer $n$ , let \\begin{align*} S_n &= 1 + \\frac 12 + \\frac…","config":"","split":"test","body":"{\"problem\":\"For each positive integer  $n$ , let \\\\begin{align*} S_n &= 1 + \\\\frac 12 + \\\\frac 13 + \\\\cdots + \\\\frac 1n \\\\\\\\ T_n &= S_1 + S_2 + S_3 + \\\\cdots + S_n \\\\\\\\ U_n &= \\\\frac{T_1}{2} + \\\\frac{T_2}{3} + \\\\frac{T_3}{4} + \\\\cdots + \\\\frac{T_n}{n+1}. \\\\end{align*} Find, with proof, integers $0 < a,\\\\ b,\\\\ c,\\\\ d < 1000000$ such that $T_{1988} = a S_{1989} - b$ and $U_{1988} = c S_{1989} - d$ .\"}","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":[]}