{"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":"be7ab7e0-1a21-5d0f-8dc2-f37dc0aac4ab","task_key":"number~5ftheory--test--be7ab7e0-1a21-5d0f-8dc2-f37dc0aac4ab","task_revision_id":"1","upstream_id":"","short_description":"If $n>1$ is an integer, the notation $a\\equiv b\\pmod{n}$ means that $(a-b)$ is a…","config":"number_theory","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"If $n>1$ is an integer, the notation $a\\\\equiv b\\\\pmod{n}$ means that $(a-b)$ is a multiple of $n$. Find the sum of all possible values of $n$ such that both of the following are true: $171\\\\equiv80\\\\pmod{n}$ and $468\\\\equiv13\\\\pmod{n}$.\",\"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":[]}