2026 AMC 10B Problem 22

Attempt Problem 22 of the 2026 AMC 10B 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 2026 AMC 10B solutions, or check the answer key.

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

22.

Belinda follows a path on the plane that is entirely contained within the square region 0≤x≤40\le x\le4 and 0≤y≤4.0\le y\le4. Call her path dignified if and only if all of the following conditions are satisfied.
• Each step is one unit up, down, or to the right.
• The path does not revisit any vertex.
• The path starts at (a,0)(a,0) and ends at (b,0),(b,0), where aa and bb are integers with a<b,a\lt b, and touches the xx-axis only at these two points.
The following figure shows some examples of dignified and not dignified paths.
How many dignified paths can Belinda follow?
174174
340340
448448
512512
970970
Answer: C
Concepts:lattice pathsmultiplication principle
Small hint:
Count by the horizontal distance d=b−ad=b-a
Big hint:
Choose the height of each rightward step; the vertical parts are then forced
Solution:
Fix the number of rightward steps. Each must be at height 1,1, 2,2, 3,3, or 4,4, because the path stays in the square and touches the xx-axis only at its endpoints.
For example, take two rightward steps at heights 22 and 3,3, starting at (1,0).(1,0). The path must go up to height 2,2, right, up to height 3,3, right, then down to the axis.
Once the start and heights are chosen, the vertical parts are forced. Between rightward steps, go straight up or down to the next height. Reversing direction would revisit a vertex. Every choice of heights gives a valid path: the heights stay positive, and after moving right the path never returns to an earlier column.
With two rightward steps, the starting xx-coordinate can be 0,0, 1,1, or 2:2: there are 33 starting positions. Each step independently has 44 height choices, so this case contributes 3×42=483\times4^2=48 paths.
In general, let d=b−ad=b-a be the number of rightward steps. It can be 1,1, 2,2, 3,3, or 4.4. The starting xx-coordinate can be any integer from 00 through 4−d,4-d, giving 5−d5-d positions. There are 4d4^d choices for the heights.
The total number of paths is 4×4+3×42+2×43+44=448.\begin{aligned}&4\times4+3\times4^2\\&\quad+2\times4^3+4^4\\&=448.\end{aligned}
Thus, the correct answer is C.
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.Terms of UsePrivacy PolicyCOPPA Privacy Policy