{"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":"68057931-7aad-5c50-aa7d-5ecd65f2402e","task_key":"test--68057931-7aad-5c50-aa7d-5ecd65f2402e","task_revision_id":"1","upstream_id":"","short_description":"Determine whether there exists a positive integer \\(n\\) for which…","config":"","split":"test","body":"{\"problem\":\"Determine whether there exists a positive integer \\\\(n\\\\) for which \\\\(g(n)>n^{0.999 n}\\\\), where \\\\(f(n), g(n)\\\\) are the minimal positive integers such that \\\\(1+\\\\frac{1}{1!}+\\\\frac{1}{2!}+\\\\ldots+\\\\frac{1}{n!}=\\\\frac{f(n)}{g(n)}\\\\).\"}","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":[]}