{"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":"94489021-7935-53d7-a8de-f268f4af4a79","task_key":"test--94489021-7935-53d7-a8de-f268f4af4a79","task_revision_id":"1","upstream_id":"","short_description":"For a positive integer $n$, let $\\theta(n)$ denote the number of integers $0…","config":"","split":"test","body":"{\"problem\":\"For a positive integer $n$, let $\\\\theta(n)$ denote the number of integers $0 \\\\leq x<2010$ such that $x^{2}-n$ is divisible by 2010. Determine the remainder when $\\\\sum_{n=0}^{2009} n \\\\cdot \\\\theta(n)$ is divided by 2010.\"}","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":[]}