{"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":"e9f6643d-89df-5d0c-8914-78e1dfaefbd5","task_key":"test--e9f6643d-89df-5d0c-8914-78e1dfaefbd5","task_revision_id":"1","upstream_id":"","short_description":"Define the Fibonacci numbers by $F_{0}=0, F_{1}=1, F_{n}=F_{n-1}+F_{n-2}$ for $n…","config":"","split":"test","body":"{\"problem\":\"Define the Fibonacci numbers by $F_{0}=0, F_{1}=1, F_{n}=F_{n-1}+F_{n-2}$ for $n \\\\geq 2$. For how many $n, 0 \\\\leq n \\\\leq 100$, is $F_{n}$ a multiple of 13?\"}","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":[]}