{"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":"c7cb241a-1d25-563a-a177-ed5fd62b87ae","task_key":"test--c7cb241a-1d25-563a-a177-ed5fd62b87ae","task_revision_id":"1","upstream_id":"","short_description":"Our third and final item comes to us from Germany, I mean Geometry. It is known…","config":"","split":"test","body":"{\"problem\":\"Our third and final item comes to us from Germany, I mean Geometry. It is known that a regular $n$-gon can be constructed with straightedge and compass if $n$ is a prime that is 1 plus a power of 2. It is also possible to construct a $2 n$-gon whenever an $n$-gon is constructible, or a $p_{1} p_{2} \\\\cdots p_{m}$-gon where the $p_{i}$ 's are distinct primes of the above form. What is really interesting is that these conditions, together with the fact that we can construct a square, is that they give us all constructible regular $n$-gons. What is the largest $n$ less than $4,300,000,000$ such that a regular $n$-gon is constructible?\"}","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":[]}