CZ-SK-MO 1993 Problem 2
In fields of a table are written integers so that any two lying on neighboring fields differ at most by (two fields are neighboring if they share a side). Find the greatest possible number of mutually different integers in such a table.
Dataset text AI-MO AoPS. 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.