{"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":"f8c4ff45-6426-549f-81b4-55ec7cf4cbed","task_key":"test--f8c4ff45-6426-549f-81b4-55ec7cf4cbed","task_revision_id":"1","upstream_id":"","short_description":"The Fibonacci sequence is defined as follows: $F_{0}=0, F_{1}=1$, and…","config":"","split":"test","body":"{\"problem\":\"The Fibonacci sequence is defined as follows: $F_{0}=0, F_{1}=1$, and $F_{n}=F_{n-1}+F_{n-2}$ for all integers $n \\\\geq 2$. Find the smallest positive integer $m$ such that $F_{m} \\\\equiv 0(\\\\bmod 127)$ and $F_{m+1} \\\\equiv 1(\\\\bmod 127)$.\"}","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":[]}