Skip to content

Erdős problem 321

What is the largest A⊆{1,…,N}A\subseteq\{1,\dots,N\} such that all subset sums ∑n∈S1/n\sum_{n\in S}1/n (over S⊆AS\subseteq A) are distinct?

Sources

The source's own material, retained exactly.

7 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

321.lean

Retained formal statement3 of 6

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

FormalConjectures/ErdosProblems/321.leanErdos321.erdos_321.variants.isLittleO1 lineExact file
(fun N => ↑(Erdos321.R N)) =o[Filter.atTop] sorry
OpenStatement only, no proofformal statement reference