Skip to published state

Erdős problem / erdos

no open offer

Problem 457

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_3a5500283ca34a95

    theoretical

    Erdős Problem #457: declared status 'proved'. Formalized: yes. Is there some ϵ>0\epsilon>0 such that there are infinitely many nn where all primes p(2+ϵ)lognp\leq (2+\epsilon)\log n divide1ilogn(n+i)?\prod_{1\leq i\leq \log n}(n+i)? Current best: More generally, let q(n,k)q(n,k) denote the least prime which does not divide 1ik(n+i)\prod_{1\leq i\leq k}(n+i). Prize: no. OEIS: A391668. Tags: number theory.

    recordedOpen record