AMC8 2014 8, Problem 11

Jack wants to bike from his house to Jill's house, which is located three blocks east and two blocks north of Jack's house. After biking each block, Jack can continue either east or north, but he needs to avoid a dangerous intersection one block east and one block north of his house. In how many ways can he reach Jill's house by biking a total of five blocks?

Solution: We can apply complementary counting and count the paths that DO go through the blocked intersection, which is $\dbinom{2}{1}\dbinom{3}{1}=6$. There are a total of $\dbinom{5}{2}=10$ paths, so there are $10-6=4$ paths possible. $\fbox{4}$ is the correct answer.

Answer: 4