{"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":"f91692e0-6412-5ce5-9536-7e5cac71a60e","task_key":"test--f91692e0-6412-5ce5-9536-7e5cac71a60e","task_revision_id":"1","upstream_id":"","short_description":"Let $f: \\mathbb{N} \\rightarrow \\mathbb{N}$ be a strictly increasing function…","config":"","split":"test","body":"{\"problem\":\"Let $f: \\\\mathbb{N} \\\\rightarrow \\\\mathbb{N}$ be a strictly increasing function such that $f(1)=1$ and $f(2n)f(2n+1)=9f(n)^{2}+3f(n)$ for all $n \\\\in \\\\mathbb{N}$. Compute $f(137)$.\"}","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":[]}