{"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":"880311b6-92f5-5732-a2db-194ab0e44696","task_key":"test--880311b6-92f5-5732-a2db-194ab0e44696","task_revision_id":"1","upstream_id":"","short_description":"The Fibonacci numbers are defined by $F_{0}=0, F_{1}=1$, and…","config":"","split":"test","body":"{\"problem\":\"The Fibonacci numbers are defined by $F_{0}=0, F_{1}=1$, and $F_{n}=F_{n-1}+F_{n-2}$ for $n \\\\geq 2$. There exist unique positive integers $n_{1}, n_{2}, n_{3}, n_{4}, n_{5}, n_{6}$ such that $\\\\sum_{i_{1}=0}^{100} \\\\sum_{i_{2}=0}^{100} \\\\sum_{i_{3}=0}^{100} \\\\sum_{i_{4}=0}^{100} \\\\sum_{i_{5}=0}^{100} F_{i_{1}+i_{2}+i_{3}+i_{4}+i_{5}}=F_{n_{1}}-5 F_{n_{2}}+10 F_{n_{3}}-10 F_{n_{4}}+5 F_{n_{5}}-F_{n_{6}}$. Find $n_{1}+n_{2}+n_{3}+n_{4}+n_{5}+n_{6}$.\"}","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":[]}