{"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":"ce481e13-2610-509f-8c8f-223f5eb26868","task_key":"test--ce481e13-2610-509f-8c8f-223f5eb26868","task_revision_id":"1","upstream_id":"","short_description":"For positive integers $n$, let $f(n)$ be the product of the digits of $n$. Find…","config":"","split":"test","body":"{\"problem\":\"For positive integers $n$, let $f(n)$ be the product of the digits of $n$. Find the largest positive integer $m$ such that $$\\\\sum_{n=1}^{\\\\infty} \\\\frac{f(n)}{m\\\\left\\\\lfloor\\\\log _{10} n\\\\right\\\\rfloor}$$ is 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":[]}