{"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":"4fbc320f-d6e1-503e-9e56-88ab63b6a149","task_key":"test--4fbc320f-d6e1-503e-9e56-88ab63b6a149","task_revision_id":"1","upstream_id":"","short_description":"A finite set $S$ of positive integers has the property that, for each $s \\in S,$…","config":"","split":"test","body":"{\"problem\":\"A finite set $S$ of positive integers has the property that, for each $s \\\\in S,$ and each positive integer divisor $d$ of $s$ , there exists a unique element $t \\\\in S$ satisfying $\\\\text{gcd}(s, t) = d$ . (The elements $s$ and $t$ could be equal.)\\nGiven this information, find all possible values for the number of elements of $S$ .\"}","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":[]}