Erdős problem 1190 · problems.science

Let $\epsilon_m=\max \sum \frac{1}{n_i}$ where the maximum is taken over all finite sequences $m<n_1<\cdots<n_k$ for which there exist congruences $a_i\pmod{n_i}$ such that no integer satisfies two such congruences.

Sources

Browse retained paths and inspect the exact material available for this Problem.

5 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

1190.lean

Retained formal statement2 of 5

The work of de la Bretèche, Ford, and Vandehey [BFV13] implies $L(m)^{-1+o(1)}< \epsilon_m < L(m)^{-\sqrt{3}/2+o(1)},$ where $L(m)=\exp(\sqrt{\log m\log\log m})$ . The lower bound is implicit in their construction.

FormalConjectures/ErdosProblems/1190.leanErdos1190.erdos_1190.variants.lower_bound1 lineExact file

1∀ (ε : ℝ), 0 < ε → ∀ᶠ (m : ℕ) in Filter.atTop, scaleL m ^ (-1 - ε) < Erdos1190.eps m

SolvedStatement only, no proof

Sources

Search problems.science