2024 AIME I Problems/Problem 6

Revision as of 13:30, 2 February 2024 by Eevee9406 (talk | contribs) (introduction)

Problem

An $8*8$ grid is shown. Find the number of paths from the lower-left hand corner to the upper-right hand corner that consist of $16$ grid movements and exactly four “turns.” [REWORD PLZ]

Solution

We divide the path into eight “$R$” movements and eight “$U$” movements. Five sections of alternative $RURUR$ or $URURU$ are necessary in order to make four “turns.” We use the first case and multiply by $2$.


For $U$, we have seven ordered pairs of positive integers $(a,b)$ such that $a+b=8$.

For $R$, we subtract $1$ from each section (as the minimum is $1$) and we use Stars and Bars to get $(7 \choose 5)=21$.


Thus our answer is $7*21*2=\boxed{294}$.