{"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":"79f0ec7d-ab46-5ba5-b8f6-5e617373d726","task_key":"prealgebra--test--79f0ec7d-ab46-5ba5-b8f6-5e617373d726","task_revision_id":"1","upstream_id":"","short_description":"How many 3-letter \"words\" can be formed from the standard 26-letter alphabet, if…","config":"prealgebra","split":"test","body":"{\"level\":\"Level 4\",\"problem\":\"How many 3-letter \\\"words\\\" can be formed from the standard 26-letter alphabet, if the first letter must be a vowel (A, E, I, O, or U)? (We aren't necessarily talking about English words; something like EQX is perfectly valid here.)\",\"type\":\"Prealgebra\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}