{"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":"6971132c-3bef-58af-bdd0-6783c90915f3","task_key":"test--6971132c-3bef-58af-bdd0-6783c90915f3","task_revision_id":"1","upstream_id":"","short_description":"For positive integers $a, b, a \\uparrow \\uparrow b$ is defined as follows: $a…","config":"","split":"test","body":"{\"problem\":\"For positive integers $a, b, a \\\\uparrow \\\\uparrow b$ is defined as follows: $a \\\\uparrow \\\\uparrow 1=a$, and $a \\\\uparrow \\\\uparrow b=a^{a \\\\uparrow \\\\uparrow(b-1)}$ if $b>1$. Find the smallest positive integer $n$ for which there exists a positive integer $a$ such that $a \\\\uparrow \\\\uparrow 6 \\\\not \\\\equiv a \\\\uparrow \\\\uparrow 7$ $\\\\bmod n$.\"}","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":[]}