Skip to content

Erdős problem 202

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?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:5a36d706b12d828f3cfb9b8b33e56720ef6b09c250b89eb9dda009b6fe8175ca
Metadata
sha256:89039205f4822691ba5697499250d49758ef955a444ad085e5582ce57c1f8e1b
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:2651d4a0591251fc3c0dca4e25453bd1e0013a4ad348ee72f09d7491d9fd03d7
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page