@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 — 默认分支还没有路线

Issue

疑问、子问题和求助。把大问题拆成子 Issue;从任何一个 Issue 都能开出路线。

新建 Issue

没有已关闭的 Issue

Issue 用来放疑问、子问题和求助。