{"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":"8a671765-4c10-5e6e-a85a-23157c3b72ad","task_key":"test--8a671765-4c10-5e6e-a85a-23157c3b72ad","task_revision_id":"1","upstream_id":"","short_description":"Let $C=\\{4,6,8,9,10, \\ldots\\}$ be the set of composite positive integers. For…","config":"","split":"test","body":"{\"problem\":\"Let $C=\\\\{4,6,8,9,10, \\\\ldots\\\\}$ be the set of composite positive integers. For each $n \\\\in C$ let $a_{n}$ be the smallest positive integer $k$ such that $k$ ! is divisible by $n$. Determine whether the following series converges: $$\\\\sum_{n \\\\in C}\\\\left(\\\\frac{a_{n}}{n}\\\\right)^{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":[]}