{"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":"4fde9317-38d8-5929-9a97-bdd01546dae5","task_key":"test--4fde9317-38d8-5929-9a97-bdd01546dae5","task_revision_id":"1","upstream_id":"","short_description":"For each positive integer $n$, denote by $\\omega(n)$ the number of distinct…","config":"","split":"test","body":"{\"problem\":\"For each positive integer $n$, denote by $\\\\omega(n)$ the number of distinct prime divisors of $n$ (for example, $\\\\omega(1)=0$ and $\\\\omega(12)=2$). Find all polynomials $P(x)$ with integer coefficients, such that whenever $n$ is a positive integer satisfying $\\\\omega(n)>2023^{2023}$, then $P(n)$ is also a positive integer with\\n\\\\[\\\\omega(n)\\\\ge\\\\omega(P(n)).\\\\]\\n\\nGreece (Minos Margaritis - Iasonas Prodromidis)\"}","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":[]}