{"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":"c7145f5c-a64f-5e7d-9c15-4728de536ee8","task_key":"test--c7145f5c-a64f-5e7d-9c15-4728de536ee8","task_revision_id":"1","upstream_id":"","short_description":"In Mathcity, there are infinitely many buses and infinitely many stations. The…","config":"","split":"test","body":"{\"problem\":\"In Mathcity, there are infinitely many buses and infinitely many stations. The stations are indexed by the powers of $2: 1, 2, 4, 8, 16, ...$ Each bus goes by finitely many stations, and the bus number is the sum of all the stations it goes by. For simplifications, the mayor of Mathcity wishes that the bus numbers form an arithmetic progression with common difference $r$ and whose first term is the favourite number of the mayor. For which positive integers $r$ is it always possible that, no matter the favourite number of the mayor, given any $m$ stations, there is a bus going by all of them?\"}","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":[]}