{"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":"112a9fa4-f535-521b-98b4-d80489e5f752","task_key":"test--112a9fa4-f535-521b-98b4-d80489e5f752","task_revision_id":"1","upstream_id":"","short_description":"Let $ \\mathcal{P}$ be a convex polygon with $ n$ sides, $ n\\ge3$. Any set of $ n…","config":"","split":"test","body":"{\"problem\":\"Let $ \\\\mathcal{P}$ be a convex polygon with $ n$ sides, $ n\\\\ge3$. Any set of $ n \\\\minus{} 3$ diagonals of $ \\\\mathcal{P}$ that do not intersect in the interior of the polygon determine a [i]triangulation[/i] of $ \\\\mathcal{P}$ into $ n \\\\minus{} 2$ triangles. If $ \\\\mathcal{P}$ is regular and there is a triangulation of $ \\\\mathcal{P}$ consisting of only isosceles triangles, find all the possible values of $ 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":[]}