{"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":"8a5f4fa7-2a47-5103-9647-ddb209442c54","task_key":"test--8a5f4fa7-2a47-5103-9647-ddb209442c54","task_revision_id":"1","upstream_id":"","short_description":"Let $S$ be the set of $3^{4}$ points in four-dimensional space where each…","config":"","split":"test","body":"{\"problem\":\"Let $S$ be the set of $3^{4}$ points in four-dimensional space where each coordinate is in $\\\\{-1,0,1\\\\}$. Let $N$ be the number of sequences of points $P_{1}, P_{2}, \\\\ldots, P_{2020}$ in $S$ such that $P_{i} P_{i+1}=2$ for all $1 \\\\leq i \\\\leq 2020$ and $P_{1}=(0,0,0,0)$. (Here $P_{2021}=P_{1}$.) Find the largest integer $n$ such that $2^{n}$ divides $N$.\"}","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":[]}