Erdős problem 361

Let $c > 0$ and $n$ be some large integer. What is the size of the largest set $A \subseteq \{1, \ldots, \lfloor c n \rfloor\}$ such that $n$ is not a sum of a subset of $A$ ? Does this depend on $n$ in an irregular way?

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

361.lean

Retained formal statement2 of 3

Asymptotic version of Erdős Problem 361: determine the order of growth of the largest cardinality as $n \to \infty$ .

FormalConjectures/ErdosProblems/361.leanErdos361.erdos_361.asymptotic1 lineExact file

1∀ (c : ℝ), 0 < c → (fun n => ↑(Erdos361.subsetSumAvoidanceNumber c n)) =Θ[Filter.atTop] sorry

OpenStatement only, no proof