{"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":"2a5e92fc-ff84-545c-b16e-c2be82f8cd0e","task_key":"test--2a5e92fc-ff84-545c-b16e-c2be82f8cd0e","task_revision_id":"1","upstream_id":"","short_description":"Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \\ldots a_{n^2 \\plus{}…","config":"","split":"test","body":"{\"problem\":\"Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \\\\ldots a_{n^2 \\\\plus{} n}$ satisfying the following conditions:\\n\\\\[ \\\\text{ (a) } a_i \\\\in \\\\left\\\\{0,1\\\\right\\\\} \\\\text{ for all } 1 \\\\leq i \\\\leq n^2 \\\\plus{} n;\\n\\\\]\\n\\n\\\\[ \\\\text{ (b) } a_{i \\\\plus{} 1} \\\\plus{} a_{i \\\\plus{} 2} \\\\plus{} \\\\ldots \\\\plus{} a_{i \\\\plus{} n} < a_{i \\\\plus{} n \\\\plus{} 1} \\\\plus{} a_{i \\\\plus{} n \\\\plus{} 2} \\\\plus{} \\\\ldots \\\\plus{} a_{i \\\\plus{} 2n} \\\\text{ for all } 0 \\\\leq i \\\\leq n^2 \\\\minus{} n.\\n\\\\]\\n[i]Author: Dusan Dukic, Serbia[/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":[]}