Counting and combinatorics
Walking a grid, part 3 of 3
AdvancedNumeric answer
Walking a grid · Part 3 of 3
You walk on a grid from (0, 0) to (4, 3), taking unit steps either right or up.
The point (2, 2) is blocked. How many shortest paths avoid it?
Answer with a number. Fractions, powers and expressions like 23/6 or C(52,5) are read correctly in practice.
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
More counting and combinatorics questions
- Five distinct analysts are split into two teams.Applied · Premium
- Eight traders are paired up for a desk-swap day, four pairs in all, and the…Applied · Premium
- Five points are placed anywhere in a 1 × 1 square.Applied · Premium
- A path from (0,0) to (5,5) takes unit steps right or up.Advanced · Premium
- Candidate A finishes with a votes and candidate B with b < a.Advanced · Premium
- How many subsets of {1,2,…,10} contain no two consecutive integers? Count the empty set.Advanced · Premium