{"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":"02987e63-1d40-57c8-bb58-77e4f624adb5","task_key":"test--02987e63-1d40-57c8-bb58-77e4f624adb5","task_revision_id":"1","upstream_id":"","short_description":"Find all positive integers $n$ such that there are $k \\geq 2$ positive rational…","config":"","split":"test","body":"{\"problem\":\"Find all positive integers $n$ such that there are $k \\\\geq 2$ positive rational numbers $a_1, a_2, \\\\ldots, a_k$ satisfying $a_1 + a_2 + \\\\ldots + a_k = a_1 \\\\cdot a_2 \\\\cdots a_k = n.$\"}","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":[]}