{"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":"3c576168-e419-5bb2-9ae2-673ae296fd30","task_key":"counting~5fand~5fprobability--test--3c576168-e419-5bb2-9ae2-673ae296fd30","task_revision_id":"1","upstream_id":"","short_description":"Suppose that $*(n) = \\left\\{ n-2, n+2, 2n, \\frac{n}{2} \\right\\}$. For example,…","config":"counting_and_probability","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"Suppose that $*(n) = \\\\left\\\\{ n-2, n+2, 2n, \\\\frac{n}{2} \\\\right\\\\}$. For example, $*(6) = \\\\{4, 8, 12, 3\\\\}$. For how many distinct integers $n$ does $*(n)$ have exactly three distinct elements?\",\"type\":\"Counting & Probability\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}