{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"a608ae72-f75e-5c87-8c60-16e6769b5dfa","task_key":"test--a608ae72-f75e-5c87-8c60-16e6769b5dfa","task_revision_id":"4","upstream_id":"","short_description":"Determine whether or not there exist two different sets $A,B$, each consisting…","config":"","split":"test","body":"{\"problem\":\"Determine whether or not there exist two different sets $A,B$, each consisting of at most $2011^2$ positive integers, such that every $x$ with $0 < x < 1$ satisfies the following inequality:\\n\\\\[\\\\left| \\\\sum_{a \\\\in A} x^a - \\\\sum_{b \\\\in B} x^b \\\\right| < (1-x)^{2011}.\\\\]\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}