{"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":"4ef9e69f-26dd-5c49-ba9e-10a764cd791d","task_key":"test--4ef9e69f-26dd-5c49-ba9e-10a764cd791d","task_revision_id":"1","upstream_id":"","short_description":"Does there exist a sequence $ F(1), F(2), F(3), \\ldots$ of non-negative integers…","config":"","split":"test","body":"{\"problem\":\"Does there exist a sequence $ F(1), F(2), F(3), \\\\ldots$ of non-negative integers that simultaneously satisfies the following three conditions?\\n\\n[b](a)[/b] Each of the integers $ 0, 1, 2, \\\\ldots$ occurs in the sequence.\\n[b](b)[/b] Each positive integer occurs in the sequence infinitely often.\\n[b](c)[/b] For any $ n \\\\geq 2,$\\n\\\\[ F(F(n^{163})) \\\\equal{} F(F(n)) \\\\plus{} F(F(361)).\\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":[]}