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+ϵ)klog⁡kn_k>(1+\epsilon)k\log k for all kk. Then #{m<nk:m≢ai(modni) for 1≤i≤k}≠o(k). \#\{ m<n_k : m\not\equiv a_i\pmod{n_i} \textrm{ for }1\leq i\leq k\}\neq o(k).

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:6dc18b0cd2b99748c071c6a5b3cc3382a91a78fd4c88c34f0f44f4a3144b6451
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb