New Results for Covering Systems of Residue Sets

@inproceedings{Berger1985NewRF,
  title={New Results for Covering Systems of Residue Sets},
  author={Marc A. Berger and Alexander Felzenbaum and Aviezri S. Fraenkel},
  year={1985}
}
We announce some new results about systems of residue sets. A residue set R C Z is an arithmetic progression R = {a,a±n,a± 2n,...}. The positive integer n is referred to as the modulus of R. Following Znam [21] we denote this set by a(n). We need several number-theoretic functions. p(ra)-the least prime divisor of a natural number ra, P(m)-the greatest prime divisor of ra, A(m)-the greatest divisor of m which is a power of a single prime: A(ra) = max{d G Z: d\m, d = p s , p prime}, /(ra) = Ylj… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Unsolved problems in number theory, Springer-Verlag

R. K. Guy
1981

On a generalization of Mycielski's and Znarn's conjectures about coset decomposition of Abelian groups

I. Korec
Fund. Math • 1974

Generalization of some results for exactly covering systems, Mat

S. Porubsky
Casopis Sloven. Akad. Vied • 1972

Roots of unity and covering

M. Newman
sets, Math. Ann • 1971

Churchhouse, Covering sets and systems of congruences, Computers in Mathematical Research (R

R F.
1968

Old and new problems and results in combinatorial number theory , Monographie No

R. L. Graham
1952

On a problem concerning covering systems (Hungarian; English summary)

P. Erdôs
Mat. Lapok • 1952

Similar Papers

Loading similar papers…