Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source: arXiv v2, pp. 1 and 3, Theorem 1 and its deduction from Claim 2.1 and Theorem 3.

Statement

There is an absolute constant C>0C>0 such that, for every minimal covering system with distinct moduli

q1<q2<⋯<qkq_1<q_2<\cdots<q_k

and every 1≤j≤k1\le j\le k,

qj≤exp⁡(Cj2log⁡(j+1)).(1)q_j\le\exp\left(\frac{Cj^2}{\log(j+1)}\right). \tag{1}

Full proof

Apply Claim 2.1 with ℓ=j\ell=j. The resulting indexed shifted tail Cj\mathcal C_j covers Z\mathbb Z, has multiplicity exactly 2j−12^{j-1}, and has smallest modulus qjq_j. Therefore Theorem 3 gives

qj≤exp⁡(clog⁡2(2j−1+1)log⁡log⁡(2j−1+2)).(2)q_j\le \exp\left( c\frac{\log^2(2^{j-1}+1)}{\log\log(2^{j-1}+2)} \right). \tag{2}

For j≥2j\ge2, log⁡(2j−1+1)≪j\log(2^{j-1}+1)\ll j and log⁡log⁡(2j−1+2)≫log⁡(j+1)\log\log(2^{j-1}+2)\gg\log(j+1), with absolute constants. Hence the exponent in (2) is O(j2/log⁡(j+1))O(j^2/\log(j+1)). Enlarging the constant handles j=1j=1 and gives (1).

For j=1j=1, this is an unspecified absolute minimum-modulus bound. The paper's new quantitative content is the uniform dependence on the rank jj; it does not improve the previously published explicit bound 616000616000 for the smallest modulus.

Bears on

  • Problem 2, through the case j=1j=1.
  • Problem 1188, by constraining the ordered moduli in every minimal distinct cover, without estimating the number F(x)F(x) of such systems.