benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let B_(k)(n) be the largest possible number of elements in a 2-separable k-configuration of a set with 2n elements (2≤k≤n). Find a closed-form expression (i.e. an expression not in…

Problem

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

problem

Let Bk(n)B_{k}(n) be the largest possible number of elements in a 2-separable kk-configuration of a set with 2n2n elements (2≤k≤n)(2 \leq k \leq n). Find a closed-form expression (i.e. an expression not involving any sums or products with a variable number of terms) for Bk(n)B_{k}(n).
Plain-text mathematical notation (without MathML)
Let B_(k)(n) be the largest possible number of elements in a 2-separable k-configuration of a set with 2n elements (2≤k≤n). Find a closed-form expression (i.e. an expression not involving any sums or products with a variable number of terms) for B_(k)(n).
Original LaTeX notation
Let $B_{k}(n)$ be the largest possible number of elements in a 2-separable $k$-configuration of a set with $2n$ elements $(2 \leq k \leq n)$. Find a closed-form expression (i.e. an expression not involving any sums or products with a variable number of terms) for $B_{k}(n)$.

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

task_id
5445f53a-8775-5044-b08f-d25aa90efd0b
task_key
test--5445f53a-8775-5044-b08f-d25aa90efd0b
task_revision_id
1
config / split
/ test

Official source

initial import