{"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":"a70848ca-5d46-52da-81d5-19d9d585d712","task_key":"test--a70848ca-5d46-52da-81d5-19d9d585d712","task_revision_id":"4","upstream_id":"","short_description":"Let $ n$ be a positive integer. Given an integer coefficient polynomial $ f(x)$,…","config":"","split":"test","body":"{\"problem\":\"Let $ n$ be a positive integer. Given an integer coefficient polynomial $ f(x)$, define its [i]signature modulo $ n$[/i] to be the (ordered) sequence $ f(1), \\\\ldots , f(n)$ modulo $ n$. Of the $ n^n$ such $ n$-term sequences of integers modulo $ n$, how many are the signature of some polynomial $ f(x)$ if\\r\\na) $ n$ is a positive integer not divisible by the square of a prime.\\r\\nb) $ n$ is a positive integer not divisible by the cube of a prime.\"}","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":[]}