{"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":"66ac6562-d1e9-5969-b6e2-6245be009bc1","task_key":"test--66ac6562-d1e9-5969-b6e2-6245be009bc1","task_revision_id":"1","upstream_id":"","short_description":"Let $a_{1}=3$, and for $n \\geq 1$, let $a_{n+1}=(n+1) a_{n}-n$. Find the…","config":"","split":"test","body":"{\"problem\":\"Let $a_{1}=3$, and for $n \\\\geq 1$, let $a_{n+1}=(n+1) a_{n}-n$. Find the smallest $m \\\\geq 2005$ such that $a_{m+1}-1 \\\\mid a_{m}^{2}-1$.\"}","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":[]}