The time is now - Spring classes are filling up!

MIT PRIMES/Art of Problem Solving

CROWDMATH 2021: Extremal combinatorics

G
Topic
First Poster
Last Poster
Asymptotically Optimal Construction for General C
EdwinNational   5
N Jul 13, 2022 by LoneShadow379
We give an explicit construction with $n$ letters $1, 2, \ldots n$, and show that it has leading constant $\frac{1}{2}$:
Note: $S_x$ is a sequence $S$ repeated $x$ times. We call each $S$ in the construction a $\textit{snippit}$.
Construction

Proof that the construction works
5 replies
EdwinNational
Jan 30, 2021
LoneShadow379
Jul 13, 2022
No more topics!
a