benchmarks.wiki / Public workspace

Omni-MATH / A ten-level 2-tree is drawn in the plane: a vertex A₁ is marked, it is connected by segments with two vertices B₁ and B₂, each of B₁ and B₂ is connected by segments with two of the… · Discussion

Discussing A ten-level 2-tree is drawn in the plane: a vertex A₁ is marked, it is connected by segments with two vertices B₁ and B₂, each of B₁ and B₂ is connected by segments with two of the… · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.