{"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":"48e820e8-49bd-56c4-945e-d23eb46bb044","task_key":"test--48e820e8-49bd-56c4-945e-d23eb46bb044","task_revision_id":"3","upstream_id":"","short_description":"For positive integer $k>1$, let $f(k)$ be the number of ways of factoring $k$…","config":"","split":"test","body":"{\"problem\":\"For positive integer $k>1$, let $f(k)$ be the number of ways of factoring $k$ into product of positive integers greater than $1$ (The order of factors are not countered, for example $f(12)=4$, as $12$ can be factored in these $4$ ways: $12,2\\\\cdot 6,3\\\\cdot 4, 2\\\\cdot 2\\\\cdot 3$.\\nProve: If $n$ is a positive integer greater than $1$, $p$ is a prime factor of $n$, then $f(n)\\\\leq \\\\frac{n}{p}$\"}","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":[]}