{"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":"bc78fc48-0624-5e38-bab6-18cfa2eadb16","task_key":"test--bc78fc48-0624-5e38-bab6-18cfa2eadb16","task_revision_id":"1","upstream_id":"","short_description":"Find the number of positive integers $j \\leq 3^{2013}$ such that…","config":"","split":"test","body":"{\"problem\":\"Find the number of positive integers $j \\\\leq 3^{2013}$ such that $$j=\\\\sum_{k=0}^{m}\\\\left((-1)^{k} \\\\cdot 3^{a_{k}}\\\\right)$$ for some strictly increasing sequence of nonnegative integers $\\\\left\\\\{a_{k}\\\\right\\\\}$. For example, we may write $3=3^{1}$ and $55=3^{0}-3^{3}+3^{4}$, but 4 cannot be written in this form.\"}","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":[]}