{"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":"9b4ae0db-b54c-55a4-9fbb-b3f27d8e38b8","task_key":"test--9b4ae0db-b54c-55a4-9fbb-b3f27d8e38b8","task_revision_id":"1","upstream_id":"","short_description":"Let $p$ be a prime number. Prove the following theorem of Euler: the equation…","config":"","split":"test","body":"{\"problem\":\"Let $p$ be a prime number. Prove the following theorem of Euler: the equation $p=x^{2}+3 y^{2}$ has a solution with $x, y \\\\in \\\\mathbb{Z}$ if and only if $p=3$ or $p \\\\equiv 1(\\\\bmod 3)$. (You may use the fact that the ring of integers of $\\\\mathbb{Q}(\\\\sqrt{-3})$ is a principal ideal domain.)\"}","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":[]}