{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"9b1b5883-a0d8-5afc-ac00-732ab95a4ea7","task_key":"test--9b1b5883-a0d8-5afc-ac00-732ab95a4ea7","task_revision_id":"4","upstream_id":"","short_description":"Assume $n$ is a positive integer. Considers sequences $a_0, a_1, \\ldots, a_n$…","config":"","split":"test","body":"{\"problem\":\"Assume $n$ is a positive integer. Considers sequences $a_0, a_1, \\\\ldots, a_n$ for which $a_i \\\\in \\\\{1, 2, \\\\ldots , n\\\\}$ for all $i$ and $a_n = a_0$. \\r\\n\\r\\n(a) Suppose $n$ is odd. Find the number of such sequences if $a_i - a_{i-1} \\\\not \\\\equiv i \\\\pmod{n}$ for all $i = 1, 2, \\\\ldots, n$.\\r\\n\\r\\n(b) Suppose $n$ is an odd prime. Find the number of such sequences if $a_i - a_{i-1} \\\\not \\\\equiv i, 2i \\\\pmod{n}$ for all $i = 1, 2, \\\\ldots, n$.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}