2014 AMC 8 Problem 11

Attempt Problem 11 of the 2014 AMC 8 below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2014 AMC 8 solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

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?
4 4
5 5
6 6
8 8
10 10
Answer: A
Concepts:lattice pathscomplementary counting
Small hint:
Any shortest path uses three east moves and two north moves.
Big hint:
Count or list only the paths that avoid the intersection after one east and one north move.
Solution:
Let E represent traveling one block east and N represent traveling one block north. A shortest route uses three E moves and two N moves. To avoid the dangerous intersection one block east and one block north of Jack’s house, the first two moves must be either EE or NN.
The possible routes are EEENNEEENN, EENENEENEN, EENNEEENNE, and NNEEENNEEE, for 44 routes.
Thus, A is the correct answer.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.