{"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":"60cb506b-042c-544d-b8f8-78ef810fda69","task_key":"test--60cb506b-042c-544d-b8f8-78ef810fda69","task_revision_id":"1","upstream_id":"","short_description":"Let $x_{1}, x_{2}, \\ldots, x_{2022}$ be nonzero real numbers. Suppose that…","config":"","split":"test","body":"{\"problem\":\"Let $x_{1}, x_{2}, \\\\ldots, x_{2022}$ be nonzero real numbers. Suppose that $x_{k}+\\\\frac{1}{x_{k+1}}<0$ for each $1 \\\\leq k \\\\leq 2022$, where $x_{2023}=x_{1}$. Compute the maximum possible number of integers $1 \\\\leq n \\\\leq 2022$ such that $x_{n}>0$.\"}","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":[]}