Skip to content

Erdős problem 1

If A{1,...,N}A\subseteq\{1, ..., N\} with A=n|A| = n is such that the subset sums aSa\sum_{a\in S}a are distinct for all SAS\subseteq A then N2n. N \gg 2 ^ n.

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:fedf1224a7e295d3ae4e16883ce521c326b6a3ef3c190fc74c6a975e7868294d
Metadata
sha256:5183abf4ae206b6f85e704ff89f5261847f00181df4d5898e139d29d0e9a6805
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:0df62dfbffc9f0ef82feec5abcff03324d402788d0db96509f88c849cba82d47
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page