{"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":"33e9f412-92a5-5fcd-be03-d04646c2e50f","task_key":"test--33e9f412-92a5-5fcd-be03-d04646c2e50f","task_revision_id":"1","upstream_id":"","short_description":"For any integer $n\\geq 2$, let $N(n)$ be the maxima number of triples $(a_i,…","config":"","split":"test","body":"{\"problem\":\"For any integer $n\\\\geq 2$, let $N(n)$ be the maxima number of triples $(a_i, b_i, c_i)$, $i=1, \\\\ldots, N(n)$, consisting of nonnegative integers $a_i$, $b_i$ and $c_i$ such  that the following two conditions are satisfied:\\n[list][*] $a_i+b_i+c_i=n$ for all $i=1, \\\\ldots, N(n)$,\\n[*] If $i\\\\neq j$ then $a_i\\\\neq a_j$, $b_i\\\\neq b_j$ and $c_i\\\\neq c_j$[/list]\\nDetermine $N(n)$ for all $n\\\\geq 2$.\\n\\n[i]\"}","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":[]}