{"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":"203548ef-0141-547b-8ca9-b6c06e999145","task_key":"test--203548ef-0141-547b-8ca9-b6c06e999145","task_revision_id":"1","upstream_id":"","short_description":"Determine all such pairs pf positive integers $(a, b)$ such that $a + b + (gcd…","config":"","split":"test","body":"{\"problem\":\"Determine all such pairs pf  positive integers $(a, b)$ such that  $a + b + (gcd (a, b))^ 2 = lcm (a, b) = 2 \\\\cdot  lcm(a -1, b)$, where $lcm (a, b)$ denotes the smallest common multiple, and $gcd (a, b)$ denotes the greatest common divisor of numbers $a, b$.\"}","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":[]}