{"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":"5a442c21-aee0-57a7-8df6-90766e7ab161","task_key":"test--5a442c21-aee0-57a7-8df6-90766e7ab161","task_revision_id":"1","upstream_id":"","short_description":"Draw a rectangle. Connect the midpoints of the opposite sides to get 4 congruent…","config":"","split":"test","body":"{\"problem\":\"Draw a rectangle. Connect the midpoints of the opposite sides to get 4 congruent rectangles. Connect the midpoints of the lower right rectangle for a total of 7 rectangles. Repeat this process infinitely. Let $n$ be the minimum number of colors we can assign to the rectangles so that no two rectangles sharing an edge have the same color and $m$ be the minimum number of colors we can assign to the rectangles so that no two rectangles sharing a corner have the same color. Find the ordered pair $(n, m)$.\"}","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":[]}