Skip to content

Erdős problem 25

Let n1<n2<…n_1 < n_2 < \dots be an arbitrary sequence of integers, each with an associated residue class ai(modni)a_i \pmod{n_i}. Let AA be the set of integers nn such that for every ii either n<nin < n_i or n≢ai(modni)n \not\equiv a_i \pmod{n_i}. Must the logarithmic density of AA exist?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:4fde8caca5ea9a47b41385e9afa1ca5f203f4ca7a95f13a8a9b5d25d72f9b99d
Metadata
sha256:855584d86f540f2e5dfd4ee90e458d9f694e5761200693176d509a00bcf2d177
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:823388d6ed5ecfc214c5b5fe03ef59c0aba00b78a42743dd2329678727dbb1db
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb