{"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":"c0609057-2018-54af-8227-c8929cf8353c","task_key":"test--c0609057-2018-54af-8227-c8929cf8353c","task_revision_id":"1","upstream_id":"","short_description":"Find all positive integers $ n$ for which the numbers in the set $ S \\equal{}…","config":"","split":"test","body":"{\"problem\":\"Find all positive integers $ n$ for which the numbers in the set $ S \\\\equal{} \\\\{1,2, \\\\ldots,n \\\\}$ can be colored red and blue, with the following condition being satisfied: The set $ S \\\\times S \\\\times S$ contains exactly $ 2007$ ordered triples $ \\\\left(x, y, z\\\\right)$ such that:\\n\\n[b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color,\\nand\\n[b](ii)[/b] the number $ x \\\\plus{} y \\\\plus{} z$ is divisible by $ n$.\\n\\n[i]Author: Gerhard W?ginger, Netherlands[/i]\"}","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":[]}