{"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":"731581c7-fd1e-596b-a221-54878a813117","task_key":"test--731581c7-fd1e-596b-a221-54878a813117","task_revision_id":"1","upstream_id":"","short_description":"A sequence of functions $\\, \\{f_n(x) \\} \\,$ is defined recursively as follows:…","config":"","split":"test","body":"{\"problem\":\"A sequence of functions  $\\\\, \\\\{f_n(x) \\\\} \\\\,$ is defined recursively as follows: \\\\begin{align*} f_1(x) &= \\\\sqrt {x^2 + 48}, \\\\quad \\\\text{and} \\\\\\\\ f_{n + 1}(x) &= \\\\sqrt {x^2 + 6f_n(x)} \\\\quad \\\\text{for } n \\\\geq 1. \\\\end{align*} (Recall that $\\\\sqrt {\\\\makebox[5mm]{}}$ is understood to represent the positive square root .) For each positive integer $n$ , find all real solutions of the equation $\\\\, f_n(x) = 2x \\\\,$ .\"}","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":[]}