{"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":"a83530ec-947f-5d9b-a4c3-cb8c40c466fe","task_key":"test--a83530ec-947f-5d9b-a4c3-cb8c40c466fe","task_revision_id":"1","upstream_id":"","short_description":"The Fibonacci numbers are defined by $F_{1}=F_{2}=1$ and $F_{n+2}=F_{n+1}+F_{n}$…","config":"","split":"test","body":"{\"problem\":\"The Fibonacci numbers are defined by $F_{1}=F_{2}=1$ and $F_{n+2}=F_{n+1}+F_{n}$ for $n \\\\geq 1$. The Lucas numbers are defined by $L_{1}=1, L_{2}=2$, and $L_{n+2}=L_{n+1}+L_{n}$ for $n \\\\geq 1$. Calculate $\\\\frac{\\\\prod_{n=1}^{15} \\\\frac{F_{2 n}}{F_{n}}}{\\\\prod_{n=1}^{13} L_{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":[]}