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?
Actions
Submit a Proof
Have a proof attempt? Submit it for zero-trust verification.
theorem erdos_361.smallO
(c : ℝ) (hc : 0 < c)
(A : ℕ → ℕ)
(hA : ∀ c n, A n = ((Finset.Icc 1 ⌊c * n⌋₊).powerset.filter
(fun B ↦ n ≠ ∑ a ∈ B, a)).sup Finset.card) :
(fun n ↦ (A n : ℝ)) =o[atTop] (answer(sorry) : ℕ → ℝ)
