{"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":"e786a0e1-7eb1-5e70-9733-e9b5979a29ea","task_key":"test--e786a0e1-7eb1-5e70-9733-e9b5979a29ea","task_revision_id":"1","upstream_id":"","short_description":"To every natural number $k, k \\geq 2$, there corresponds a sequence $a_n(k)$…","config":"","split":"test","body":"{\"problem\":\"To every natural number $k, k \\\\geq 2$, there corresponds a sequence $a_n(k)$ according to the following rule:\\n\\\\[a_0 = k, \\\\qquad a_n = \\\\tau(a_{n-1})  \\\\quad \\\\forall n \\\\geq 1,\\\\]\\nin which $\\\\tau(a)$ is the number of different divisors of $a$. Find all $k$ for which the sequence $a_n(k)$ does not contain the square of an integer.\"}","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":[]}