{"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":"00ed18ea-1f21-53cc-a643-225ff77a3451","task_key":"test--00ed18ea-1f21-53cc-a643-225ff77a3451","task_revision_id":"1","upstream_id":"","short_description":"Find all integers $n$ satisfying $n \\geq 2$ and $\\dfrac{\\sigma(n)}{p(n)-1} = n$,…","config":"","split":"test","body":"{\"problem\":\"Find all integers $n$ satisfying $n \\\\geq 2$ and $\\\\dfrac{\\\\sigma(n)}{p(n)-1} = n$, in which $\\\\sigma(n)$ denotes the sum of all positive divisors of $n$, and $p(n)$ denotes the largest prime 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":[]}