{"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":"6fbc5e28-b713-56e2-bf37-34849c2c4c26","task_key":"test--6fbc5e28-b713-56e2-bf37-34849c2c4c26","task_revision_id":"1","upstream_id":"","short_description":"Let $a_{1}, a_{2}, \\ldots$ be a sequence of positive integers such that for…","config":"","split":"test","body":"{\"problem\":\"Let $a_{1}, a_{2}, \\\\ldots$ be a sequence of positive integers such that for integers $n>2, a_{n}=$ $3 a_{n-1}-2 a_{n-2}$. How many such sequences $\\\\left\\\\{a_{n}\\\\right\\\\}$ are there such that $a_{2010} \\\\leq 2^{2012}$ ?\"}","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":[]}