{"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":"7597d5e0-4c94-5876-a48b-dfddbc3cbde5","task_key":"test--7597d5e0-4c94-5876-a48b-dfddbc3cbde5","task_revision_id":"1","upstream_id":"","short_description":"Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$,…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\\\\dots a_n$ of the\\nsequence $1$, $2$, $\\\\dots$ , $n$ satisfying\\n$$a_1 \\\\le 2a_2\\\\le 3a_3 \\\\le \\\\dots \\\\le na_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":[]}