{"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":"397c36b7-36d5-5c5e-8597-e81cf60a0269","task_key":"test--397c36b7-36d5-5c5e-8597-e81cf60a0269","task_revision_id":"1","upstream_id":"","short_description":"Let $ a, b \\in \\mathbb{N}$ with $ 1 \\leq a \\leq b,$ and $ M \\equal{} \\left[\\frac…","config":"","split":"test","body":"{\"problem\":\"Let $ a, b \\\\in \\\\mathbb{N}$  with $ 1 \\\\leq a \\\\leq b,$ and $ M \\\\equal{} \\\\left[\\\\frac {a \\\\plus{} b}{2} \\\\right].$ Define a function $ f: \\\\mathbb{Z} \\\\mapsto \\\\mathbb{Z}$ by\\n\\\\[ f(n) \\\\equal{} \\\\begin{cases} n \\\\plus{} a, & \\\\text{if } n \\\\leq M, \\\\\\\\\\nn \\\\minus{} b, & \\\\text{if } n >M. \\\\end{cases}\\n\\\\]\\nLet $ f^1(n) \\\\equal{} f(n),$ $ f_{i \\\\plus{} 1}(n) \\\\equal{} f(f^i(n)),$ $ i \\\\equal{} 1, 2, \\\\ldots$ Find the smallest natural number $ k$ such that $ f^k(0) \\\\equal{} 0.$\"}","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":[]}