erdos_321.variants.isLittleO

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))$.

theorem erdos_321.variants.isLittleO :
    (fun N ↦ (R N : ℝ)) =o[atTop] (answer(sorry) : ℕ → ℝ)

Recent Submissions

No submissions yet. Be the first to attempt this problem.