{"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":"bfd999d0-69c5-5a3a-862c-2a8b304c9454","task_key":"counting~5fand~5fprobability--test--bfd999d0-69c5-5a3a-862c-2a8b304c9454","task_revision_id":"1","upstream_id":"","short_description":"How many paths are there from $A$ to $B$ on the lines of the grid shown, if…","config":"counting_and_probability","split":"test","body":"{\"level\":\"Level 3\",\"problem\":\"How many paths are there from $A$ to $B$ on the lines of the grid shown, if every step must be up or to the right?[asy]size(3cm,3cm);int w=6;int h=3;int i;for (i=0; i<h; ++i){ draw((0,i) -- (w-1,i));}for (i=0; i<w; ++i){ draw((i, 0)--(i,h-1));}label(\\\"$B$\\\", (w-1,h-1), NE);label(\\\"$A$\\\", (0,0), SW);[/asy]\\nFor example, here is one such valid path highlighted in blue:\\n[asy]\\nsize(3cm,3cm);\\nint w=6;\\nint h=3;\\nint i;\\nfor (i=0; i<h; ++i){ \\ndraw((0,i) -- (w-1,i));\\n}for (i=0; i<w; ++i){ \\ndraw((i, 0)--(i,h-1));\\n}\\nlabel(\\\"$B$\\\", (w-1,h-1), NE);\\nlabel(\\\"$A$\\\", (0,0), SW);\\n\\ndraw((0,0)--(1,0), blue+1.5);\\ndraw((1,0)--(1,1), blue+1.5);\\ndraw((1,1)--(2,1), blue+1.5);\\ndraw((2,1)--(3,1), blue+1.5);\\ndraw((3,1)--(4,1), blue+1.5);\\ndraw((4,1)--(4,2), blue+1.5);\\ndraw((4,2)--(5,2), blue+1.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":[]}