{"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":"7299591b-18dd-5f85-a4e1-88eb43ac322c","task_key":"test--7299591b-18dd-5f85-a4e1-88eb43ac322c","task_revision_id":"1","upstream_id":"","short_description":"For any integer $n \\ge2$, we define $ A_n$ to be the number of positive integers…","config":"","split":"test","body":"{\"problem\":\"For any integer $n \\\\ge2$, we define $ A_n$ to be the number of positive integers $ m$ with the following property: the distance from $n$ to the nearest multiple of $m$ is equal to the distance from $n^3$ to the nearest multiple of $ m$. Find all integers $n \\\\ge 2 $ for which $ A_n$ is odd. (Note: The distance between two integers $ a$ and $b$ is defined as $|a -b|$.)\"}","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":[]}