PPL 033 / 177 permanent IDsPrize Problem Ledger · PPLChecked 2026.07.26
Prize Problem LedgerPPL · Open reward indexAll 177 problems
Prize Problem LedgerErdősPPL 033Erdős Problem #1

Permanent problem IDPPL 033

Verified openErdősconjecture

Number theory

Erdős Problem #1

If A⊆ {1,…,N} with | A|=n is such that the subset sums ∑_(a∈ S)a are distinct for all S⊆ A then N ≫ 2^(n).

number theoryadditive combinatorics
01

The problem

If A⊆ {1,…,N} with | A|=n is such that the subset sums ∑_(a∈ S)a are distinct for all S⊆ A then N ≫ 2^(n).

Open since1931exact
Last checked2026.07.26Catalog verification
02

Reward offers

Offer 01$500Paul Erdős / Combinatorics Foundation
Documented

A solution must appear in a reputable journal, with documentation that Erdős offered the displayed amount. Claims are administered by the Combinatorics Foundation; erdosproblems.com does not pay awards.

Award source ↗Rules ↗
03

Sources & reading

3 unique reference linksCanonical problem page Claim or award rules OEIS A276661
04

Related open targets

Number theoryBeal conjecturePPL 005 · $1,000,000 · 33 years openNumber theoryBirch–Swinnerton-Dyer conjecturePPL 006 · $1,000,000 · 61 years openNumber theoryRiemann hypothesisPPL 138 · $1,000,000 · 167 years open