{"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":"4d6d6422-3d32-5135-a10c-7ded8dd29b87","task_key":"test--4d6d6422-3d32-5135-a10c-7ded8dd29b87","task_revision_id":"1","upstream_id":"","short_description":"Consider the sequence: $x_1=19,x_2=95,x_{n+2}=\\text{lcm} (x_{n+1},x_n)+x_n$, for…","config":"","split":"test","body":"{\"problem\":\"Consider the sequence: $x_1=19,x_2=95,x_{n+2}=\\\\text{lcm} (x_{n+1},x_n)+x_n$, for $n>1$, where $\\\\text{lcm} (a,b)$ means the least common multiple of $a$ and $b$. Find the greatest common divisor of $x_{1995}$ and $x_{1996}$.\"}","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":[]}