{"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":"abd82a92-17ef-5d3b-acb6-c37c03555f48","task_key":"test--abd82a92-17ef-5d3b-acb6-c37c03555f48","task_revision_id":"1","upstream_id":"","short_description":"For an integer $n$, let $f_{9}(n)$ denote the number of positive integers $d…","config":"","split":"test","body":"{\"problem\":\"For an integer $n$, let $f_{9}(n)$ denote the number of positive integers $d \\\\leq 9$ dividing $n$. Suppose that $m$ is a positive integer and $b_{1}, b_{2}, \\\\ldots, b_{m}$ are real numbers such that $f_{9}(n)=\\\\sum_{j=1}^{m} b_{j} f_{9}(n-j)$ for all $n>m$. Find the smallest possible value of $m$.\"}","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":[]}