benchmarks.wiki / Public workspace

Omni-MATH / For each interger n≥4, we consider the m subsets A₁,A₂,…,A_(m) of {1,2,3,…,n}, such that A₁ has exactly one element, A₂ has exactly two elements,...., A_(m) has exactly m elements …

Problem

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

problem

For each interger n≥4n\geq 4, we consider the mm subsets A1,A2,…,AmA_1, A_2,\dots, A_m of {1,2,3,…,n}\{1, 2, 3,\dots, n\}, such that A1A_1 has exactly one element, A2A_2 has exactly two elements,...., AmA_m has exactly mm elements and none of these subsets is contained in any other set. Find the maximum value of mm.
Plain-text mathematical notation (without MathML)
For each interger n≥4, we consider the m subsets A₁,A₂,…,A_(m) of {1,2,3,…,n}, such that
A₁ has exactly one element, A₂ has exactly two elements,...., A_(m) has exactly m elements and none of these subsets is contained in any other set. Find the maximum value of m.
Original LaTeX notation
For each interger $n\geq 4$, we consider the $m$ subsets $A_1, A_2,\dots, A_m$ of $\{1, 2, 3,\dots, n\}$, such that
$A_1$ has exactly one element, $A_2$ has exactly two elements,...., $A_m$ has exactly $m$ elements and none of these subsets is contained in any other set. Find the maximum value of $m$.

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