Skip to content

Erdős problem 349

For 0<α≤10 < \alpha \le 1 and any t>0t > 0, (t,α)(t, \alpha) is not a good pair: every term ⌊tαn⌋\lfloor t\alpha^n\rfloor lies in the finite interval [0,⌊t⌋][0, \lfloor t\rfloor] (since αn≤1\alpha^n \le 1), so every subset sum is bounded by the constant ∑i∈[0,⌊t⌋]i\sum_{i \in [0,\lfloor t\rfloor]} i, and no large integer can be a subset sum. A partial result on the open Erdős Problem 349, complementing the 2<α2 < \alpha and integer-coefficient cases.

Sources

The source's own material, retained exactly.

12 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

349.lean

Retained formal statement5 of 12

For what values of t,α∈(0,∞)t,\alpha \in (0,\infty) is the sequence ⌊tαn⌋\lfloor t\alpha^n\rfloor complete (that is, all sufficiently large integers are the sum of distinct integers of the form ⌊tαn⌋\lfloor t\alpha^n\rfloor)?

FormalConjectures/ErdosProblems/349.leanErdos349.erdos_3491 lineExact file
{(t, α) | 0 < t ∧ 0 < α ∧ Erdos349.IsGoodPair t α} = sorry
OpenStatement only, no proof