Skip to published state

Erdős problem / erdos

no open offer

Problem 359

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_8dcf62f2cdf2268b

    theoretical

    Erdős Problem #359: declared status 'open'. Formalized: yes. Let a1<a2<a_1<a_2<\cdots be an infinite sequence of integers such that a1=na_1=n and ai+1a_{i+1} is the least integer which is not a sum of consecutive earlier aja_js. What can be said about the density of this sequence? In particular, in the case n=1n=1, can one prove that ak/ka_k/k\to \infty and ak/k1+c0a_k/k^{1+c}\to 0 for any c>0c>0? Current best: Andrews conjecturesakklogkloglogk.a_k\sim \frac{k\log k}{\log\log k}.Porubsky [Po77] proved that, for any ϵ>0\epsilon>0, there are infinitely many kk such thatak<(logk)ϵklogkloglogk,a_k < (\log k)^\epsilon \frac{k\log k}{\log\log k},and also that if A(x)A(x) counts the number of aixa_i\leq x thenlim supA(x)π(x)1log2\limsup \frac{A(x)}{\pi(x)}\geq \frac{1}{\log 2}where π(x)\pi(x) counts the number of primes x\leq x. Prize: no. OEIS: A002048. Tags: number theory.

    recordedOpen record