{"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":"02331d68-582e-5c47-947e-89ec72cc2c9b","task_key":"test--02331d68-582e-5c47-947e-89ec72cc2c9b","task_revision_id":"1","upstream_id":"","short_description":"Two different integers $u$ and $v$ are written on a board. We perform a sequence…","config":"","split":"test","body":"{\"problem\":\"Two different integers $u$ and $v$ are written on a board. We perform a sequence of steps. At each step we do one of the following two operations:\\n\\n(i) If $a$ and $b$ are different integers on the board, then we can write $a + b$ on the board, if it is not\\nalready there.\\n(ii) If $a$, $b$ and $c$ are three different integers on the board, and if an integer $x$ satisfies $ax^2 +bx+c = 0$,\\nthen we can write $x$ on the board, if it is not already there.\\n\\nDetermine all pairs of starting numbers $(u, v)$ from which any integer can eventually be written on the board after a finite sequence of steps.\"}","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":[]}