Skip to content

Erdős problem 281

Let n1<n2<⋯n_1<n_2<\cdots be an infinite sequence such that, for any choice of congruence classes ai(modni)a_i\pmod{n_i}, the set of integers not satisfying any of the congruences ai(modni)a_i\pmod{n_i} has density 00. Is it true that for every ϵ>0\epsilon>0 there exists some kk such that, for every choice of congruence classes aia_i, the density of integers not satisfying any of the congruences ai(modni)a_i\pmod{n_i} for 1≤i≤k1\leq i\leq k is less than ϵ\epsilon?

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:e5ef2963dfb42bba1d46a74119d3bfede807cdedfd894ea99f1ecb5e12edcc58
Metadata
sha256:e0fef80c0ece1c46193c86e560caa2ef5d6817827109da2d4088fb4c0fb21733
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:a38f8279dc89beab74eb16503cddae5728009e074ef8e9fc2bddeaedecd1366a
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb