Math 2.0

Theorem

Newman-Znám theorem

Statement

Štefan Znám in 1968 and subsequently Morris Newman in 1971 proved a general form of Mirsky–Newman theorem, namely given a disjoint covering system, suppose the maximum of the moduli nn occurs ll times, then l≥pl \geq p, the smallest prime dividing nn. In 1986, an non-analytic proof of this general result was given.

Further reading

  1. Wikipedia, page 3603349, revision 1357173515, Herzog–Schönheim conjecture, section Mirsky–Newman theorem > Newman-Znám theorem. adopted
About this page
TagWFQDNE306H
URIm2://WFQDNE306H
Kindstatement, theorem
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status WFQDNE306H.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.