benchmarks.wiki / Public workspace

Omni-MATH / Suppose A has n elements, where n≥2, and C is a 2-configuration of A that is not m-separable for any m<n. What is (in terms of n) the smallest number of elements that C can have?

Problem

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

problem

Suppose AA has nn elements, where n≥2n \geq 2, and CC is a 2-configuration of AA that is not mm-separable for any m<nm<n. What is (in terms of nn) the smallest number of elements that CC can have?
Plain-text mathematical notation (without MathML)
Suppose A has n elements, where n≥2, and C is a 2-configuration of A that is not m-separable for any m<n. What is (in terms of n) the smallest number of elements that C can have?
Original LaTeX notation
Suppose $A$ has $n$ elements, where $n \geq 2$, and $C$ is a 2-configuration of $A$ that is not $m$-separable for any $m<n$. What is (in terms of $n$) the smallest number of elements that $C$ can have?

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