{"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":"cb8f7349-94ce-5962-b447-f2883baa5de2","task_key":"test--cb8f7349-94ce-5962-b447-f2883baa5de2","task_revision_id":"1","upstream_id":"","short_description":"Let $ a, b, c, d,m, n \\in \\mathbb{Z}^\\plus{}$ such that \\[…","config":"","split":"test","body":"{\"problem\":\"Let $ a, b, c, d,m, n \\\\in \\\\mathbb{Z}^\\\\plus{}$ such that \\\\[ a^2\\\\plus{}b^2\\\\plus{}c^2\\\\plus{}d^2 \\\\equal{} 1989,\\\\]\\n\\\\[ a\\\\plus{}b\\\\plus{}c\\\\plus{}d \\\\equal{} m^2,\\\\] and the largest of $ a, b, c, d$ is $ n^2.$ Determine, with proof, the values  of $m$ and $ n.$\"}","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":[]}