2011 | OriginalPaper | Buchkapitel
Dense Model Theorems and Their Applications
verfasst von : Luca Trevisan
Erschienen in: Theory of Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In 2004, Ben Green and Terry Tao [6] proved that, for every
k
, there are infinitely many length-
k
arithmetic progressions made entirely of prime numbers. This settled a very long-standing open question in number theory that had been open even for the
k
= 4 case.