Skip to published state

Erdős problem / erdos

no open offer

Problem 875

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_f81c0c7f0ec5bfa0

    theoretical

    Erdős Problem #875: declared status 'open'. Formalized: no. Let A={a1<a2<}NA=\{a_1<a_2<\cdots\}\subset \mathbb{N} be an infinite set such that the setsSr={a1++ar:a1<<arA}S_r = \{ a_1+\cdots +a_r : a_1<\cdots<a_r\in A\}are disjoint for distinct r1r\geq 1. How fast can such a sequence grow? How small can an+1ana_{n+1}-a_n be? In particular, for which cc is it possible that an+1annca_{n+1}-a_n\leq n^{c}? Prize: no. Tags: additive combinatorics.

    recordedOpen record