{"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":"21f4c16b-d8d2-555f-a857-ece71db1074d","task_key":"test--21f4c16b-d8d2-555f-a857-ece71db1074d","task_revision_id":"1","upstream_id":"","short_description":"Let $a_{1}, a_{2}, a_{3}, \\ldots$ be a sequence of positive integers where…","config":"","split":"test","body":"{\"problem\":\"Let $a_{1}, a_{2}, a_{3}, \\\\ldots$ be a sequence of positive integers where $a_{1}=\\\\sum_{i=0}^{100} i$! and $a_{i}+a_{i+1}$ is an odd perfect square for all $i \\\\geq 1$. Compute the smallest possible value of $a_{1000}$.\"}","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":[]}