{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"670f5f3c-1a34-5183-9039-a463e472f60b","task_key":"test--670f5f3c-1a34-5183-9039-a463e472f60b","task_revision_id":"3","upstream_id":"","short_description":"Call a sequence of positive integers $\\{a_n\\}$ good if for any distinct positive…","config":"","split":"test","body":"{\"problem\":\"Call a sequence of positive integers $\\\\{a_n\\\\}$ good if for any distinct positive integers $m,n$, one has \\n$$\\\\gcd(m,n) \\\\mid a_m^2 + a_n^2 \\\\text{ and } \\\\gcd(a_m,a_n) \\\\mid m^2 + n^2.$$\\nCall a positive integer $a$ to be $k$-good if there exists a good sequence such that $a_k = a$. Does there exists a $k$ such that there are exactly $2019$ $k$-good positive integers?\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}