KöMaL 2024 K811
We have filled in the squares of the chessboard with the positive integers from to in increasing order, starting from the top left corner and proceeding row by row. Is it possible to delete two numbers from two adjacent squares (two squares sharing an edge or a vertex) such that the sum of the remaining numbers is exactly ?
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.