{"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":"60484837-79cd-5fee-b693-281affdb0e60","task_key":"test--60484837-79cd-5fee-b693-281affdb0e60","task_revision_id":"1","upstream_id":"","short_description":"For a polynomialƒ $P$ and a positive integer $n$, define $P_{n}$ as the number…","config":"","split":"test","body":"{\"problem\":\"For a polynomialƒ $P$ and a positive integer $n$, define $P_{n}$ as the number of positive integer pairs $(a, b)$ such that $a<b \\\\leq n$ and $|P(a)|-|P(b)|$ is divisible by $n$. Determine all polynomial $P$ with integer coefficients such that for all positive integers $n, P_{n} \\\\leq 2021$.\"}","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":[]}