{"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":"37a74eeb-0b6e-5efc-a37a-2d8194564e4c","task_key":"number~5ftheory--test--37a74eeb-0b6e-5efc-a37a-2d8194564e4c","task_revision_id":"1","upstream_id":"","short_description":"Let $m$ be a positive integer, and suppose that $9$ is its own inverse $\\pmod…","config":"number_theory","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"Let $m$ be a positive integer, and suppose that $9$ is its own inverse $\\\\pmod m$, but $3$ is $\\\\textbf{not}$ its own inverse $\\\\pmod m$.\\n\\nHow many possible values for $m$ are there?\",\"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":[]}