{"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":"5445f53a-8775-5044-b08f-d25aa90efd0b","task_key":"test--5445f53a-8775-5044-b08f-d25aa90efd0b","task_revision_id":"1","upstream_id":"","short_description":"Let $B_{k}(n)$ be the largest possible number of elements in a 2-separable…","config":"","split":"test","body":"{\"problem\":\"Let $B_{k}(n)$ be the largest possible number of elements in a 2-separable $k$-configuration of a set with $2n$ elements $(2 \\\\leq k \\\\leq n)$. Find a closed-form expression (i.e. an expression not involving any sums or products with a variable number of terms) for $B_{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":[]}