Question 25
In an $ n \times n $ board, for each $ 1 \leq i \leq n $ and $ 1 \leq j \leq n $, the cell in the $ i^{\text{th}} $ row from the bottom and $ j^{\text{th}} $ column from the left contains $\gcd(i,j)$ leaves. A koala travels from the bottom left corner to the top right corner. At each step, the koala moves up or to the right by a single cell. The koala eats the leaves in each cell it visits, including the bottom left and top right cells.
Determine the maximum number of leaves that the koala can eat.
Here $ \gcd(x,y) $ denotes the greatest common divisor of integers x and y.
Determine the maximum number of leaves that the koala can eat.
Here $ \gcd(x,y) $ denotes the greatest common divisor of integers x and y.