Problem:
Each lattice point with nonnegative coordinates is labeled with a nonnegative integer in such a way that the point is labeled by , and for every , the set of numbers labeled on the points , , and is for some nonnegative integer . Determine, with proof, all possible labels for the point .
, 2024
Solution
Solution:
We claim the answer is all multiples of from to .
First, we prove no other values are possible. Let denote the label of cell .
## The label is divisible by 3.
Observe that for any and , , , and are all distinct mod . Thus, for any and , cannot match or , so it must be equivalent to modulo .
Since , , are all distinct , and and are equivalent mod , then , , are all distinct , and thus similarly , , are all distinct mod , which means that must be neither or , and thus must be equal to .

These together imply that
It follows that must be equivalent to , which is a multiple of .
## The label is at most 6048.
Note that since , , and are consecutive numbers, and are both . Moreover, since , since it is also the same mod , it must be at most . Thus, , and , so .
## Construction.
Consider lines of the form (so lies on ). Then any three points of the form , , and lie on three consecutive lines , , in some order. Thus, for any which is a multiple of , if we label every point on line with , any three consecutive lines , , will either be labelled in some order, or , both of which consist of three consecutive numbers. Below is an example with .

| 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | |
|---|---|---|---|---|---|---|---|---|
| 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | |
| 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | |
| 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | |
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | |
| 1 | 2 | 0 | 1 | 2 | 3 | 4 | 5 | |
| 2 | 0 | 1 | 2 | 0 | 1 | 2 | 3 | |
| 0 | 1 | 2 | 0 | 1 | 2 | 0 | 1 |
Any such labelling is valid, and letting range from to , we see can take any label of the form , which spans all such multiples of .
Hence the possible labels are precisely the multiples of from to .