{"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":"f6ca765c-0069-594d-b860-1062ebc4fe1e","task_key":"test--f6ca765c-0069-594d-b860-1062ebc4fe1e","task_revision_id":"1","upstream_id":"","short_description":"Let $F(0)=0, F(1)=\\frac{3}{2}$, and $F(n)=\\frac{5}{2} F(n-1)-F(n-2)$ for $n \\geq…","config":"","split":"test","body":"{\"problem\":\"Let $F(0)=0, F(1)=\\\\frac{3}{2}$, and $F(n)=\\\\frac{5}{2} F(n-1)-F(n-2)$ for $n \\\\geq 2$. Determine whether or not $\\\\sum_{n=0}^{\\\\infty} \\\\frac{1}{F\\\\left(2^{n}\\\\right)}$ is a rational number.\"}","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":[]}