ISL 2009 C2
For any integer , let be the maximal number of triples , consisting of nonnegative integers and such that the following two conditions are satisfied: (1) for all , (2) If , then and . Determine for all . Comment. The original problem was formulated for -tuples instead for triples. The numbers are then defined similarly to in the case . The numbers and should be determined. The case is the same as in the present problem. The upper bound for can be proved by a simple generalization. The construction of a set of triples attaining the bound can be easily done by induction from to .
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
N(n)=\left\lfloor\frac{2 n}{3}\right\rfloor+1
Solutions
Official solution Solution 1 by the IMO Problem Selection Committee
The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).
Similar problems
These problems have the most words in common with this statement.