{"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":"fea48a54-5ade-560f-8db6-4683e2fe392f","task_key":"test--fea48a54-5ade-560f-8db6-4683e2fe392f","task_revision_id":"4","upstream_id":"","short_description":"$ S$ is a non-empty subset of the set $ \\{ 1, 2, \\cdots, 108 \\}$, satisfying:","config":"","split":"test","body":"{\"problem\":\"$ S$ is a non-empty subset of the set $ \\\\{ 1, 2, \\\\cdots, 108 \\\\}$, satisfying:\\r\\n\\r\\n(1) For any two numbers $ a,b \\\\in S$ ( may not distinct), there exists $ c \\\\in S$, such that $ \\\\gcd(a,c)\\\\equal{}\\\\gcd(b,c)\\\\equal{}1$.\\r\\n\\r\\n(2) For any two numbers $ a,b \\\\in S$ ( may not distinct), there exists $ c' \\\\in S$, $ c' \\\\neq a$, $ c' \\\\neq b$, such that $ \\\\gcd(a, c') > 1$, $ \\\\gcd(b,c') >1$.\\r\\n\\r\\nFind the largest possible value of $ |S|$.\"}","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":[]}