{"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":"dd5fbbfa-3d08-5ee4-afd7-73a809a5cfd3","task_key":"algebra--test--dd5fbbfa-3d08-5ee4-afd7-73a809a5cfd3","task_revision_id":"1","upstream_id":"","short_description":"Suppose we define $\\ell(n)$ as follows: If $n$ is an integer from $0$ to $20,$…","config":"algebra","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"Suppose we define $\\\\ell(n)$ as follows: If $n$ is an integer from $0$ to $20,$ inclusive, then $\\\\ell(n)$ is the number of letters in the English spelling of the number $n;$ otherwise, $\\\\ell(n)$ is undefined. For example, $\\\\ell(11)=6,$ because \\\"eleven\\\" has six letters, but $\\\\ell(23)$ is undefined, because $23$ is not an integer from $0$ to $20.$\\n\\nHow many numbers are in the domain of $\\\\ell(n)$ but not the range of $\\\\ell(n)?$\",\"type\":\"Algebra\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}