Skip to published state

Erdős problem / erdos

no open offer

Problem 202

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_9ec551f1a5a2682d

    theoretical

    Erdős Problem #202: declared status 'solved'. Formalized: no. Let n1<<nrNn_1<\cdots < n_r\leq N with associated ai(modni)a_i\pmod{n_i} such that the congruence classes are disjoint (that is, every integer is ai(modni)\equiv a_i\pmod{n_i} for at most one 1ir1\leq i\leq r). How large can rr be in terms of NN? Current best: Erd\H{o}s believed the lower bound is closer to the truth. These bounds were further improved by Chen [Ch05] and then by de la Bret\'{e}che, Ford, and Vandehey [BFV13] toNL(N)1+o(1)<f(N)<NL(N)3/2+o(1).\frac{N}{L(N)^{1+o(1)}}<f(N) < \frac{N}{L(N)^{\sqrt{3}/2+o(1)}}.The latter authors conjecture that the lower bound here is the truth. Prize: no. OEIS: A389975. Tags: covering systems.

    recordedOpen record