{"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":"2b2622c5-7dbc-59f1-b996-935261f253d9","task_key":"test--2b2622c5-7dbc-59f1-b996-935261f253d9","task_revision_id":"1","upstream_id":"","short_description":"Whether there are integers $a_1$, $a_2$, $\\cdots$, that are different from each…","config":"","split":"test","body":"{\"problem\":\"Whether there are integers $a_1$, $a_2$, $\\\\cdots$, that are different from each other, satisfying:\\n(1) For $\\\\forall k\\\\in\\\\mathbb N_+$, $a_{k^2}>0$ and $a_{k^2+k}<0$;\\n(2) For $\\\\forall n\\\\in\\\\mathbb N_+$, $\\\\left| a_{n+1}-a_n\\\\right|\\\\leqslant 2023\\\\sqrt 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":[]}