benchmarks.wiki / Public workspace
OlympiadBench / 2091 / For any integer n≥2, let N(n) be the maximal number of triples…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
question
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 .
Plain-text mathematical notation (without MathML)
For any integer n≥2, let N(n) be the maximal number of triples (a_(i),b_(i),c_(i)),i=1,…,N(n), consisting of nonnegative integers a_(i),b_(i) and c_(i) such that the following two conditions are satisfied: (1) a_(i)+b_(i)+c_(i)=n for all i=1,…,N(n), (2) If i≠j, then a_(i)≠a_(j),b_(i)≠b_(j) and c_(i)≠c_(j). Determine N(n) for all n≥2.
Original LaTeX notation
For any integer $n \geq 2$, let $N(n)$ be the maximal number of triples $\left(a_{i}, b_{i}, c_{i}\right), i=1, \ldots, N(n)$, consisting of nonnegative integers $a_{i}, b_{i}$ and $c_{i}$ such that the following two conditions are satisfied:
(1) $a_{i}+b_{i}+c_{i}=n$ for all $i=1, \ldots, N(n)$,
(2) If $i \neq j$, then $a_{i} \neq a_{j}, b_{i} \neq b_{j}$ and $c_{i} \neq c_{j}$.
Determine $N(n)$ for all $n \geq 2$.answer type
Expression
is multiple answer
false
language
English
question type
Open-ended
subject
Math
Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
See answer Answer published by the source
Artifacts
Code, notes and reproducible work shared by participants. Files are served from a separate origin.
No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import