{"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":"3f30b004-ff68-530e-b959-f1a2fb0596d8","task_key":"test--3f30b004-ff68-530e-b959-f1a2fb0596d8","task_revision_id":"1","upstream_id":"","short_description":"Let \\(a_{1}, a_{2}, \\ldots\\) be an infinite sequence of integers such that…","config":"","split":"test","body":"{\"problem\":\"Let \\\\(a_{1}, a_{2}, \\\\ldots\\\\) be an infinite sequence of integers such that \\\\(a_{i}\\\\) divides \\\\(a_{i+1}\\\\) for all \\\\(i \\\\geq 1\\\\), and let \\\\(b_{i}\\\\) be the remainder when \\\\(a_{i}\\\\) is divided by 210. What is the maximal number of distinct terms in the sequence \\\\(b_{1}, b_{2}, \\\\ldots\\\\)?\"}","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":[]}