Question 7
Consider a shortest path along the edges of a $7\times7$ 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?
Numerical answer only; a non-negative integer less than 1000.
Numerical answer only; a non-negative integer less than 1000.