Erdős problem 321 · problems.science

What is the largest $A\subseteq\{1,\dots,N\}$ such that all subset sums $\sum_{n\in S}1/n$ (over $S\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 statement3 of 6

Let $R(N)$ be the size of the largest $A\subseteq\{1, ..., N\}$ such that all sums $\sum_{n\in S} \frac{1}{n}$ are distinct for $S\subseteq A$ . Find the simplest $g(N)$ such that $R(N) = o(g(N))$ .

FormalConjectures/ErdosProblems/321.leanErdos321.erdos_321.variants.isLittleO1 lineExact file

1(fun N => ↑(Erdos321.R N)) =o[Filter.atTop] sorry

OpenStatement only, no proofformal statement reference

Sources

Search problems.science