A covering system with least modulus 25
From MaRDI portal
Publication:3055135
DOI10.1090/S0025-5718-08-02154-6zbMath1208.11019MaRDI QIDQ3055135
Publication date: 7 November 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Other combinatorial number theory (11B75) Congruences; primitive roots; residue systems (11A07) Arithmetic progressions (11B25)
Related Items (2)
Cites Work
- Sur un problème concernant les nombres \(k\cdot 2^n + 1\)
- A covering system whose smallest modulus is 40
- On odd covering systems with distinct moduli
- Sieving by large integers and covering systems of congruences
- Necessary conditions for distinct covering systems with square-free moduli
- Necessary condition for the existence of an incongruent covering system with odd moduli II
- Reducibility of polynomials and covering systems of congruences
- Covering the Set of Integers by Congruence Classes of Distinct Moduli
- Unsolved problems in number theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A covering system with least modulus 25