{"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":"8a2746df-6246-544b-a4a7-bbfdddf5af8b","task_key":"test--8a2746df-6246-544b-a4a7-bbfdddf5af8b","task_revision_id":"3","upstream_id":"","short_description":"Let $\\mathbb{Z}/n\\mathbb{Z}$ denote the set of integers considered modulo $n$…","config":"","split":"test","body":"{\"problem\":\"Let $\\\\mathbb{Z}/n\\\\mathbb{Z}$ denote the set of integers considered modulo $n$ (hence $\\\\mathbb{Z}/n\\\\mathbb{Z}$ has $n$ elements). Find all positive integers $n$ for which there exists a bijective function $g: \\\\mathbb{Z}/n\\\\mathbb{Z} \\\\to \\\\mathbb{Z}/n\\\\mathbb{Z}$, such that the 101 functions\\n\\\\[g(x), \\\\quad g(x) + x, \\\\quad g(x) + 2x, \\\\quad \\\\dots, \\\\quad g(x) + 100x\\\\]\\nare all bijections on $\\\\mathbb{Z}/n\\\\mathbb{Z}$.\\n\\n[i]Ashwin Sah and Yang Liu[/i]\"}","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":[]}