Erdős problem / erdos
no open offerProblem 202
Exact records and bounded producer offers matched to this problem.
Matching finding records
1 recordsvf_9ec551f1a5a2682d
theoretical
Erdős Problem #202: declared status 'solved'. Formalized: no. Let with associated such that the congruence classes are disjoint (that is, every integer is for at most one ). How large can be in terms of ? 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] toThe latter authors conjecture that the lower bound here is the truth. Prize: no. OEIS: A389975. Tags: covering systems.
recordedOpen record