{"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":"dfef505d-9815-5ea6-bf67-48e05085d412","task_key":"test--dfef505d-9815-5ea6-bf67-48e05085d412","task_revision_id":"1","upstream_id":"","short_description":"Call a positive integer $n$ quixotic if the value of $\\operatorname{lcm}(1,2,3,…","config":"","split":"test","body":"{\"problem\":\"Call a positive integer $n$ quixotic if the value of $\\\\operatorname{lcm}(1,2,3, \\\\ldots, n) \\\\cdot\\\\left(\\\\frac{1}{1}+\\\\frac{1}{2}+\\\\frac{1}{3}+\\\\ldots+\\\\frac{1}{n}\\\\right)$ is divisible by 45 . Compute the tenth smallest quixotic 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":[]}