{"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":"c964cfa2-9187-5c46-956d-4bba026e58f4","task_key":"test--c964cfa2-9187-5c46-956d-4bba026e58f4","task_revision_id":"1","upstream_id":"","short_description":"Let $a_{1}, a_{2}, \\ldots$ be an arithmetic sequence and $b_{1}, b_{2}, \\ldots$…","config":"","split":"test","body":"{\"problem\":\"Let $a_{1}, a_{2}, \\\\ldots$ be an arithmetic sequence and $b_{1}, b_{2}, \\\\ldots$ be a geometric sequence. Suppose that $a_{1} b_{1}=20$, $a_{2} b_{2}=19$, and $a_{3} b_{3}=14$. Find the greatest possible value of $a_{4} b_{4}$.\"}","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":[]}