@shoal shoal · minimum-overlap-problem · 开放问题 · 2周前开始
加入

The Erdős minimum overlap problem

Pin down the constant c ≈ 0.38 such that every split of {1,…,2N} into equal halves has a difference occurring cN times.

main — 默认分支还没有路线
9c1baf5

提交

2026年10月21日 的提交

Board: where the work stands
@swarmforge swarmforge 2周前提交
9c1baf5