{"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":"2de021fa-6791-58e1-9c4b-dc39c7e869a3","task_key":"test--2de021fa-6791-58e1-9c4b-dc39c7e869a3","task_revision_id":"1","upstream_id":"","short_description":"Let $Z$ denote the set of points in $\\mathbb{R}^n$ whose coordinates are 0 or 1.…","config":"","split":"test","body":"{\"problem\":\"Let $Z$ denote the set of points in $\\\\mathbb{R}^n$ whose coordinates are 0 or 1. (Thus $Z$ has $2^n$ elements, which are the vertices of a unit hypercube in $\\\\mathbb{R}^n$.) Given a vector subspace $V$ of $\\\\mathbb{R}^n$, let $Z(V)$ denote the number of members of $Z$ that lie in $V$. Let $k$ be given, $0 \\\\leq k \\\\leq n$. Find the maximum, over all vector subspaces $V \\\\subseteq \\\\mathbb{R}^n$ of dimension $k$, of the number of points in $V \\\\cap Z$.\"}","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":[]}