Skip to content

Erdős problem 486

Start work

For each n∈Nn \in \mathbb{N} choose some Xn⊆Z/nZX_n \subseteq \mathbb{Z}/n\mathbb{Z}. Let B={m∈N:∀n,m≢x(modn) for all x∈Xn}B = \{m \in \mathbb{N} : \forall n, m \not\equiv x \pmod{n} \text{ for all } x \in X_n\}. Must BB have a logarithmic density?

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:b29bd3e95a795392c5b530249ef5c233d72026235c42acaf94d9afeb5eecd954
Metadata
sha256:c0d6ec105e184bfa4aec50b88555f78a6be60222481a370ecfc1b6c41596cade
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:ac1e7ea00b023a7d689936c997fa240a5c16237fdee9def6f25535b475984172
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON