Find the maximum possible value of , such that the integers can be filled once each in distinct cells of a grid and satisfies the following conditions:
[list]
[*] For all , the cells with and share an edge. Cells with and also share an edge. In addition, no other pair of numbers share an edge.
[*] If two cells with in them share a vertex, then .
Problem 1336
Official solution
1. Understanding the Problem:
We need to fill a grid with integers such that:
- For all , the cells with and share an edge.
- Cells with and also share an edge.
- No other pair of numbers share an edge.
- If two cells with share a vertex, then .
2. Visualizing the Grid:
We can visualize the grid as a cycle where each number is connected to and is connected back to . This forms a Hamiltonian cycle.
3. Extending Cells:
- If a cell is a corner, extend it to a square with side .
- If a cell is a straight, extend it to a rectangle with sides and .
4. Calculating the Area:
- For corners, the area is .
- For straights, the area is .
5. Intersection of Extended Cells:
- Two extended cells intersect if and only if they are straights and they are adjacent to the same corner. Their intersection is a square with side , giving an area of .
6. Formulating the Inequality:
Let be the number of corners and be the number of straights. The total area covered by the extended cells should be less than or equal to the area of the grid (since each cell is extended):
Simplifying, we get:
7. Conclusion:
The maximum possible value of is .
The final answer is .