{"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":"7269e6bf-8d2e-5c02-b8f3-3b2db5100276","task_key":"test--7269e6bf-8d2e-5c02-b8f3-3b2db5100276","task_revision_id":"1","upstream_id":"","short_description":"Does there exist a sequence of positive integers $a_1,a_2,...$ such that every…","config":"","split":"test","body":"{\"problem\":\"Does there exist a sequence of positive integers $a_1,a_2,...$ such that every positive integer occurs exactly once and that the number $\\\\tau (na_{n+1}^n+(n+1)a_n^{n+1})$ is divisible by $n$ for all positive integer.\\n\\nHere $\\\\tau (n)$ denotes the number of positive divisor of $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":[]}