{"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":"f371fb7d-1d1f-583f-9717-481ee0e91a73","task_key":"number~5ftheory--test--f371fb7d-1d1f-583f-9717-481ee0e91a73","task_revision_id":"1","upstream_id":"","short_description":"Solve the congruence $2n \\equiv 15 \\pmod{47}$, as a residue modulo 47. (Give an…","config":"number_theory","split":"test","body":"{\"level\":\"Level 3\",\"problem\":\"Solve the congruence $2n \\\\equiv 15 \\\\pmod{47}$, as a residue modulo 47.  (Give an answer between 0 and 46.)\",\"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":[]}