请输入您要查询的字词:

 

单词 CoveringSystem
释义

covering system


A covering system is a system of congruencesMathworldPlanetmathPlanetmathPlanetmath such that every natural numberMathworldPlanetmath n is “covered” by at least one of the congruences, that is, given the finite setsMathworldPlanetmath a and m both containing k nonnegative integers (but each mi>1), for every n there’s at least one value of i such that naimodmi.

For example, Davenport gives the following system: 0mod2, 0mod3, 1mod4, 1mod6 and 11mod12. For the sake of demonstration it will be sufficient here to show that this system of congruences covers all 12<n<37. Examining the congruences in the order stated for the first half of our sample range, the multiplesMathworldPlanetmath of 2 and 3 are covered by the first two congruences, leaving us just 13, 17, 19 and 23 to worry about. The third congruence takes care of 13 and 17. The fourth congruence takes care of 19, with 13 already taken care of. The fifth congruence covers 23. In many cases, a particular number will be taken care of by more than one congruence. The following table shows all the congruences that cover the remainder of our sample range.

There are various open problemsPlanetmathPlanetmath pertaining to covering systems. Erdős conjectured that for any positive N there is always a covering system in which all the moduli are greater than N. Another one, posed by Erdős and Selfridge is whether there is a covering system in which all the moduli are odd. Erdős has presented a covering system which does not use 2 as a modulusMathworldPlanetmathPlanetmath but it does use 4.

References

  • 1 H. Davenport, The Higher Arithmetic, Sixth Edition. Cambridge: Cambridge University Press (1995): 57 - 58
  • 2 Paul Erdős & János Surányi Topics in the theory of numbers New York: Springer (2003): 46
随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 8:11:30