{"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":"87d538da-54d3-5f0c-87db-0d1f6a51c6f3","task_key":"counting~5fand~5fprobability--test--87d538da-54d3-5f0c-87db-0d1f6a51c6f3","task_revision_id":"1","upstream_id":"","short_description":"What is the shortest distance that can be travelled if you start at any point,…","config":"counting_and_probability","split":"test","body":"{\"level\":\"Level 2\",\"problem\":\"What is the shortest distance that can be travelled if you start at any point, $A$, $B$, $C$, or $D$, and visit the other three points once?\\n\\n[asy]\\npair A,B,C, D;\\nA = (-3,3); B = (3,0); C = (0, -4); D = (0,0);\\ndraw(D--B--C--cycle); draw(D--A--B--cycle);draw(D--A--C--cycle);\\nlabel(\\\"$A$\\\", A, NW);label(\\\"$B$\\\", B, E); label(\\\"$C$\\\", C, S);label(\\\"$D$\\\", D, NE);\\nlabel(\\\"3\\\", D--B, S); label(\\\"6\\\", A--B, NE); label(\\\"6\\\", A--C, SW); label(\\\"4\\\", D--C, NW+N);\\nlabel(\\\"5\\\", A--D, SE+NE); label(\\\"5\\\", C--B, E);\\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":[]}