{"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":"e04b643d-1bcd-569e-95b8-cf5efadde6ee","task_key":"counting~5fand~5fprobability--test--e04b643d-1bcd-569e-95b8-cf5efadde6ee","task_revision_id":"1","upstream_id":"","short_description":"The letters C, O, U, N and T are randomly placed around a circle. One such…","config":"counting_and_probability","split":"test","body":"{\"level\":\"Level 3\",\"problem\":\"The letters C, O, U, N and T are randomly placed around a circle. One such arrangement is shown here. If we always start with the C and continue to read the rest of the letters in order clockwise, in how many different orders can the letters appear?\\n\\n[asy]\\ndraw(circle((0,0),1),dashed);\\nlabel(\\\"U\\\",dir(90));\\nlabel(\\\"C\\\",dir(90+360/5));\\nlabel(\\\"O\\\",dir(90+2*360/5));\\nlabel(\\\"N\\\",dir(90+3*360/5));\\nlabel(\\\"T\\\",dir(90+4*360/5));\\n[/asy]\",\"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":[]}