{"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":"c28c7d2d-c604-5e9c-b0ff-9e5c0fe1e9f2","task_key":"test--c28c7d2d-c604-5e9c-b0ff-9e5c0fe1e9f2","task_revision_id":"1","upstream_id":"","short_description":"A sequence $(a_n)_{n=1}^{\\infty}$ of positive integers satisfies the condition…","config":"","split":"test","body":"{\"problem\":\"A sequence $(a_n)_{n=1}^{\\\\infty}$ of positive integers satisfies the condition $a_{n+1} = a_n +\\\\tau (n)$ for all positive integers $n$ where $\\\\tau (n)$ is the number of positive integer divisors of $n$. Determine whether two consecutive terms of this sequence can be perfect squares.\"}","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":[]}