On odd covering systems with distinct moduli (Q2573654): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aam.2005.01.004 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: math/0412217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary condition for the existence of an incongruent covering system with odd moduli / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary condition for the existence of an incongruent covering system with odd moduli II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolved problems in number theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary conditions for distinct covering systems with square-free moduli / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integers not of the form ±𝑝^{𝑎}±𝑞^{𝑏} / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the range of a covering function / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AAM.2005.01.004 / rank
 
Normal rank

Latest revision as of 07:53, 19 December 2024

scientific article
Language Label Description Also known as
English
On odd covering systems with distinct moduli
scientific article

    Statements

    On odd covering systems with distinct moduli (English)
    0 references
    0 references
    0 references
    22 November 2005
    0 references
    A covering system is a finite system of residue classes \(\{a_ i\pmod{n_ i}: i=1,\dots,k\}\) such that every integer belongs to at least one of the classes. An older conjecture of Erdős and Selfridge claims that there is no covering system with all moduli odd, distinct and \(>1\). The main result of the paper says that if such a covering system with all moduli square-free exists, then the least common multiple \(N=[n_1,\dots,n_k]\) has at least 22 prime divisors.
    0 references
    arithmetic progression
    0 references
    covering system
    0 references
    covering with odd moduli
    0 references
    Erdős-Selfridge conjecture
    0 references

    Identifiers