{"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":"75eda9a2-706e-5cdc-996f-3b904114866a","task_key":"test--75eda9a2-706e-5cdc-996f-3b904114866a","task_revision_id":"1","upstream_id":"","short_description":"Define the sequence $\\{x_{i}\\}_{i \\geq 0}$ by $x_{0}=2009$ and…","config":"","split":"test","body":"{\"problem\":\"Define the sequence $\\\\{x_{i}\\\\}_{i \\\\geq 0}$ by $x_{0}=2009$ and $x_{n}=-\\\\frac{2009}{n} \\\\sum_{k=0}^{n-1} x_{k}$ for all $n \\\\geq 1$. Compute the value of $\\\\sum_{n=0}^{2009} 2^{n} x_{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":[]}