Skip to content

Erdős problem 321

What is the largest A{1,,N}A\subseteq\{1,\dots,N\} such that all subset sums nS1/n\sum_{n\in S}1/n (over SAS\subseteq A) are distinct?

Sources

Browse retained paths and inspect the exact material available for this Problem.

7 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

321.lean

Retained formal statement1 of 6

Let R(N)R(N) be the size of the largest A{1,...,N}A\subseteq\{1, ..., N\} such that all sums nS1n\sum_{n\in S} \frac{1}{n} are distinct for SAS\subseteq A. What is R(N)R(N)?

FormalConjectures/ErdosProblems/321.leanErdos321.erdos_3211 lineExact file
∀ (N : ℕ), Erdos321.R N = sorry
OpenStatement only, no proofformal statement reference

Search problems.science

Find a Problem, Result, source, or page