{"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":"c2638a8e-dd82-5258-8897-f376db93d670","task_key":"test--c2638a8e-dd82-5258-8897-f376db93d670","task_revision_id":"1","upstream_id":"","short_description":"A permutation of the set of positive integers $[n] = \\{1, 2, \\ldots, n\\}$ is a…","config":"","split":"test","body":"{\"problem\":\"A permutation of the set of positive integers $[n] = \\\\{1, 2, \\\\ldots, n\\\\}$ is a sequence $(a_1, a_2, \\\\ldots, a_n)$ such that each element of $[n]$ appears precisely one time as a term of the sequence. For example, $(3, 5, 1, 2, 4)$ is a permutation of $[5]$ . Let $P(n)$ be the number of permutations of $[n]$ for which $ka_k$ is a perfect square for all $1\\\\leq k\\\\leq n$ . Find with proof the smallest $n$ such that $P(n)$ is a multiple of $2010$ .\"}","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":[]}