Skip to content

Erdős Problem 25: logarithmic density for a sequence avoiding size-dependent congruences #200

@mo271

Description

@mo271

What is the conjecture

https://www.erdosproblems.com/25

Let $n_1<n_2<\cdots$ be an arbitrary sequence of integers, each with an associated residue class $a_i\pmod{n_i}$. Let $A$ be the set of integers $n$ such that for every $i$ either $n<n_i$ or $n\not\equiv a_i\pmod{n_i}$. Must the logarithmic density of $A$ exist?

Status: open

Prerequisites needed

logarithmic density could be put into ForMathlib, since other problems also use it.

also see #201

Choose either option

  • I plan on working on this conjecture
  • This issue is up for grabs: I would like to see this conjecture added by somebody else

Metadata

Metadata

Assignees

Type

No type

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions