{"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":"f4b6d1d9-93e5-526e-a6d4-20f76f33042c","task_key":"test--f4b6d1d9-93e5-526e-a6d4-20f76f33042c","task_revision_id":"1","upstream_id":"","short_description":"Turbo the snail sits on a point on a circle with circumference $1$. Given an…","config":"","split":"test","body":"{\"problem\":\"Turbo the snail sits on a point on a circle with circumference $1$. Given an infinite sequence of positive real numbers $c_1, c_2, c_3, \\\\dots$, Turbo successively crawls distances $c_1, c_2, c_3, \\\\dots$ around the circle, each time choosing to crawl either clockwise or counterclockwise.\\nDetermine the largest constant $C > 0$ with the following property: for every sequence of positive real numbers $c_1, c_2, c_3, \\\\dots$ with $c_i < C$ for all $i$, Turbo can (after studying the sequence) ensure that there is some point on the circle that it will never visit or crawl across.\"}","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":[]}