Skip to content

Erdős problem 280

Let n1<n2<n_1<n_2<\cdots be an infinite sequence of integers with associated ak(modnk)a_k\pmod{n_k}, such that for some ϵ>0\epsilon>0 we have nk>(1+ϵ)klogkn_k>(1+\epsilon)k\log k for all kk. Then #{m<nk:m≢ai(modni) for 1ik}o(k). \#\{ m<n_k : m\not\equiv a_i\pmod{n_i} \textrm{ for }1\leq i\leq k\}\neq o(k).

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:37d658c0c8c6f6f0fa12ae8000669e014fddc02921b428c3ab07c3caa5470dc7
Metadata
sha256:96c2ec95c02878d73ae7ce8d6be21c9e7bacc944e61f965af5b003b482d12df9
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:6dc18b0cd2b99748c071c6a5b3cc3382a91a78fd4c88c34f0f44f4a3144b6451
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page