Basic Steps of the Proof of Schnirelmann’s Theorem

Michael Th. Rassias ()
Additional contact information
Michael Th. Rassias: University of Zürich, Institute of Mathematics

A chapter in Goldbach’s Problem, 2017, pp 87-97 from Springer

Abstract: Abstract In this chapter we provide an outline of the proof of Schnirelmann’s theorem which states that there exists a positive integer q, such that every integer greater than 1 can be represented as the sum of at most q prime numbers.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-57914-6_4

Ordering information: This item can be ordered from
http://www.springer.com/9783319579146

DOI: 10.1007/978-3-319-57914-6_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().