Skip to main content
OlympiadHQ

Browse · harp

Print

smc

counting and probability senior

Problem

A 16-step path is to go from to with each step increasing either the -coordinate or the -coordinate by 1. How many such paths stay outside or on the boundary of the square , at each step?
(A)
(B)
(C)
(D)
Solution
Each path must go through either the second or the fourth quadrant. Each path that goes through the second quadrant must pass through exactly one of the points , , and . There is path of the first kind, paths of the second kind, and paths of the third type. Each path that goes through the fourth quadrant must pass through exactly one of the points , , and . Again, there is path of the first kind, paths of the second kind, and paths of the third type. Hence the total number of paths is .
Final answer
D