{"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":"c4057d9d-493a-5799-85cf-c5b9c1cc24d5","task_key":"test--c4057d9d-493a-5799-85cf-c5b9c1cc24d5","task_revision_id":"1","upstream_id":"","short_description":"Let $F(0)=0$, $F(1)=\\frac32$, and $F(n)=\\frac{5}{2}F(n-1)-F(n-2)$","config":"","split":"test","body":"{\"problem\":\"Let $F(0)=0$, $F(1)=\\\\frac32$, and $F(n)=\\\\frac{5}{2}F(n-1)-F(n-2)$\\n  for $n\\\\ge2$.\\n\\nDetermine whether or not $\\\\displaystyle{\\\\sum_{n=0}^{\\\\infty}\\\\,\\n    \\\\frac{1}{F(2^n)}}$ is a rational number.\\n\\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":[]}