{"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":"7cc20316-56dc-59d7-b11e-3949b63226fc","task_key":"counting~5fand~5fprobability--test--7cc20316-56dc-59d7-b11e-3949b63226fc","task_revision_id":"1","upstream_id":"","short_description":"How many different three-step paths along the edges of a cube are there that…","config":"counting_and_probability","split":"test","body":"{\"level\":\"Level 3\",\"problem\":\"How many different three-step paths along the edges of a cube are there that take you from vertex $A$ to vertex $B$? (A step is from a vertex to an adjacent vertex sharing an edge.)\\n\\n[asy]\\nsize(101);\\nimport three;\\ncurrentprojection=orthographic(1/2,-1,1/4);\\ndraw((0,0,0)--(1,0,0)--(1,0,1)--(0,0,1)--(0,0,0));\\ndraw((1,0,0)--(1,1,0)--(1,1,1)--(1,0,1));\\ndraw((1,1,1)--(0,1,1)--(0,0,1));\\nlabel(\\\"A\\\",(0,0,1),(-1,0,0)); label(\\\"B\\\",(1,1,0),(1,0,0));\\n\\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":[]}