Skip to published state

Erdős problem / erdos

no open offer

Problem 711

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_b150056cb2730d68

    theoretical

    Erdős Problem #711: declared status 'open'. Formalized: no. Let f(n,m)f(n,m) be minimal such that in (m,m+f(n,m))(m,m+f(n,m)) there exist distinct integers a1,,ana_1,\ldots,a_n such that kakk\mid a_k for all 1kn1\leq k\leq n. Prove thatmaxmf(n,m)n1+o(1)\max_m f(n,m) \leq n^{1+o(1)}and thatmaxm(f(n,m)f(n,n)).\max_m (f(n,m)-f(n,n))\to \infty. Prize: ₹1000. Tags: number theory.

    recordedOpen record