{"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":"cd6276a0-d637-50e0-a983-966f7dff3ab3","task_key":"counting~5fand~5fprobability--test--cd6276a0-d637-50e0-a983-966f7dff3ab3","task_revision_id":"1","upstream_id":"","short_description":"How many paths are there from $C$ to $B$, if every step must be up or to the…","config":"counting_and_probability","split":"test","body":"{\"level\":\"Level 3\",\"problem\":\"How many paths are there from $C$ to $B$, if every step must be up or to the right?[asy]size(4cm,4cm);int w=6;int h=5;int i;pen p=fontsize(9);for (i=0; i<h; ++i){draw((0,i) -- (w-1,i));}for (i=0; i<w; ++i){draw((i, 0)--(i,h-1));}dot(\\\"$A$\\\", (0,0), SW, p);dot(\\\"$C$\\\", (1,2), NE, p);dot(\\\"$B$\\\", (w-1,h-1), NE, p);[/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":[]}