benchmarks.wiki / Public workspace

Omni-MATH / In a 999×999 square table some cells are white and the remaining ones are red. Let T be the number of triples (C₁,C₂,C₃) of cells, the first two in the same row and the last two in…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

In a 999×999999 \times 999 square table some cells are white and the remaining ones are red. Let TT be the number of triples (C1,C2,C3)(C_1,C_2,C_3) of cells, the first two in the same row and the last two in the same column, with C1,C3C_1,C_3 white and C2C_2 red. Find the maximum value TT can attain. [i]
Plain-text mathematical notation (without MathML)
In a 999×999 square table some cells are white and the remaining ones are red. Let T be the number of triples (C₁,C₂,C₃) of cells, the first two in the same row and the last two in the same column, with C₁,C₃ white and C₂ red. Find the maximum value T can attain.

[i]
Original LaTeX notation
In a $999 \times 999$ square table some cells are white and the remaining ones are red. Let $T$ be the number of triples $(C_1,C_2,C_3)$ of cells, the first two in the same row and the last two in the same column, with $C_1,C_3$ white and $C_2$ red. Find the maximum value $T$ can attain.

[i]

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. 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. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import