{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"math","formal_name":"MATH","introduction":"MATH organises 12,500 high-school competition problems into seven subjects and five difficulty levels, each with a full worked solution. It underlies much of the later mathematics evaluation work; this catalogue imports the full test split: 5,000 problems across all seven subjects.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/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":"1f93ec4f-987a-5c4a-a2ec-2b1a482e2695","task_key":"number~5ftheory--test--1f93ec4f-987a-5c4a-a2ec-2b1a482e2695","task_revision_id":"1","upstream_id":"","short_description":"Suppose we have four integers, no two of which are congruent $\\pmod 6$. Let $N$…","config":"number_theory","split":"test","body":"{\"level\":\"Level 3\",\"problem\":\"Suppose we have four integers, no two of which are congruent $\\\\pmod 6$. Let $N$ be the product of the four integers.\\n\\nIf $N$ is not a multiple of $6$, then what is the remainder of $N$ when $N$ is divided by $6$?\",\"type\":\"Number Theory\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}