{"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":"6ccaffa4-cb0e-5cec-a6ff-f1918c0e0728","task_key":"test--6ccaffa4-cb0e-5cec-a6ff-f1918c0e0728","task_revision_id":"1","upstream_id":"","short_description":"Let a sequence $\\left\\{a_{n}\\right\\}_{n=0}^{\\infty}$ be defined by…","config":"","split":"test","body":"{\"problem\":\"Let a sequence $\\\\left\\\\{a_{n}\\\\right\\\\}_{n=0}^{\\\\infty}$ be defined by $a_{0}=\\\\sqrt{2}, a_{1}=2$, and $a_{n+1}=a_{n} a_{n-1}^{2}$ for $n \\\\geq 1$. The sequence of remainders when $a_{0}, a_{1}, a_{2}, \\\\cdots$ are divided by 2014 is eventually periodic with some minimal period $p$ (meaning that $a_{m}=a_{m+p}$ for all sufficiently large integers $m$, and $p$ is the smallest such positive integer). Find $p$.\"}","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":[]}