arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.15280math.NT
收藏

模数倒数之和接近 $1$ 的覆盖系统

Covering systems with the sum of the reciprocals of the moduli close to $1$

Michael Filaseta, Alexandros Kalogirou

AI总结:

本文证明了在有限不同模覆盖系统中,当最小模数大于4时,模数倒数之和必远离1,解决了Davenport提出的问题并证实了Erdos和Selfridge的猜想。

摘要:

1952年,H. Davenport提出了一个问题:在有限的不同模覆盖系统中,确定最小模数 $m_{0}$ 的一个条件,使得该覆盖系统中模数倒数之和远离 $1$。1973年,P. Erdos 和 J. Selfridge 表示他们相信 $m_{0} > 4$ 就足够了。我们提供了证明,证明情况确实如此。

英文摘要:

In 1952, H. Davenport posed the problem of determining a condition on the minimum modulus $m_{0}$ in a finite distinct covering system that would imply that the sum of the reciprocals of the moduli in the covering system is bounded away from $1$. In 1973, P. Erdos and J. Selfridge indicated that they believed that $m_{0} > 4$ would suffice. We provide a proof that this is the case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑