{"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":"568c007c-dce8-5b9e-b406-e07b8d7dd94a","task_key":"test--568c007c-dce8-5b9e-b406-e07b8d7dd94a","task_revision_id":"1","upstream_id":"","short_description":"Let $\\mathbb{S}$ is the set of prime numbers that less or equal to 26. Is there…","config":"","split":"test","body":"{\"problem\":\"Let $\\\\mathbb{S}$ is the set of prime numbers that less or equal to 26. Is there any $a_1, a_2, a_3, a_4, a_5, a_6 \\\\in \\\\mathbb{N}$ such that $$ gcd(a_i,a_j) \\\\in \\\\mathbb{S} \\\\qquad \\\\text {for }  1\\\\leq i \\\\ne j \\\\leq 6$$ and for every element $p$ of $\\\\mathbb{S}$ there exists a pair of $ 1\\\\leq k \\\\ne l \\\\leq 6$ such that $$s=gcd(a_k,a_l)?$$\"}","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":[]}