Skip to main content

2023/24 AHSMC Part 1 Problem 10

Problem 10 of 16

An ant is at the point (0,0)(0,0) and every second it can move one unit either up or right. However, it can only move to the points (x,y)(x,y) where xx and yy are not both odd. The number of distinct paths the ant can follow to reach the point (6,12)(6,12) is

Answer choices

Show solution

Solution

When the ant is at even-even coordinates, it must advance either two steps right or two steps up to reach a new even-even point. Condensing each double step into one step, the problem becomes the number of unrestricted paths from (0,0)(0,0) to (3,6)(3,6) using only up and right moves. There are 99 steps in total, so the number of paths is (93)=84\dbinom{9}{3} = 84. The answer is (D).