A covering system whose smallest modulus is 40 (Q1011684)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5542351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A covering system whose smallest modulus is 40 |
scientific article; zbMATH DE number 5542351 |
Statements
A covering system whose smallest modulus is 40 (English)
0 references
9 April 2009
0 references
A set of congruence classes with distinct moduli, each greater than 1, such that each integer satisfies at least one of the congruences, is said to be a covering system. An old still open Erdős' conjecture from 1950 states that the least modulus \(N\) of a covering system can be arbitrarily large. Improving previous best known result with modulus \(N=25\) constructed recently by \textit{D. J. Gibson} [Math. Comput. 78, No. 266, 1127--1146 (2009; Zbl 1208.11019)] the author describes his construction of a covering system with \(N=40\). Difficulties connected with the presented construction lead the author to believe that Erdős' problem could have a negative solution
0 references
covering system
0 references
minimum modulus problem
0 references
Erdős conjecture
0 references
0.8877926
0 references
0.8361162
0 references
0 references
0.81873125
0 references
0.8153392
0 references
0.8076863
0 references
0 references
0.7997361
0 references
