Skip to content

Erdős problem 486

For each nNn \in \mathbb{N} choose some XnZ/nZX_n \subseteq \mathbb{Z}/n\mathbb{Z}. Let B={mN:n,m≢x(modn) for all xXn}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?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:ac1e7ea00b023a7d689936c997fa240a5c16237fdee9def6f25535b475984172
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page