Problem

Source: 2018 Taiwan TST Round 1

Tags: combinatorics, Taiwan



Let $n$ be a positive integer not divisible by $3$. A triangular grid of length $n$ is obtained by dissecting a regular triangle with length $n$ into $n^2$ unit regular triangles. There is an orange at each vertex of the grid, which sums up to \[\frac{(n+1)(n+2)}{2}\]oranges. A triple of oranges $A,B,C$ is good if each $AB,AC$ is some side of some unit regular triangles, and $\angle BAC = 120^{\circ}$. Each time, Yen can take away a good triple of oranges from the grid. Determine the maximum number of oranges Yen can take.