AIMO 2015 Q7

Consider a shortest path along the edges of a \(7 \times 7\) square grid from its bottom-left vertex to its top-right vertex. How many such paths have no edge above the grid diagonal that joins these vertices?

×

Problem Loading...

Note Loading...

Set Loading...