Skip to published state

finding record / erdos

recorded

vf_9ec551f1a5a2682d

Erdős Problem #202

Canonical assertion

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.

Notation is rendered from the stored source. The pinned checkout remains the exact record.

  1. database_record
  2. theoretical
  3. 0 spans
  4. recorded
Provenance summary
erdos_deep:202
database_record
Jun 16, 2026, 12:00 AM
not recorded
0
Exact record identityFinding ID, frontier identity, and pinned Git source
vf_9ec551f1a5a2682d
vfr_0a25edabc16db143
ce8ba7d934c848408e0d91caca39e938698e3fc7
03f7371b496485f761f91961027fd48198dc7e93
Exact source and rootsGit ce8ba7d934c8 and content-addressed ledgers
Commit
ce8ba7d934c848408e0d91caca39e938698e3fc7
Tree
03f7371b496485f761f91961027fd48198dc7e93
Committed
2026-07-20T19:20:20-04:00
Repository
Open source
Event log
sha256:a06797bc0d1b0e3c88a2f97507fe0832661e3992d8df41187a0aa6d3ceee9bde
Snapshot
sha256:1faedc24f040a60a22177b456c74b969a61ce8836082297b1835797a57b4fa56
Proposals
sha256:e69b38037814f2e8ca826942cfc50ab370993889be2913cac1c0b3e77711160f
Actor registry
sha256:665f3e1c48f0a50fac949681c0af01bdd28de2991f2cdc5cc4cddbe69df6311b
Artifacts
sha256:3d58619c5cfb7e28de2f344476e35c9f0b80709c996b2a1bfdb2e11496f7e1da