Dense Model Theorems and Their Applications
- Cite this paper as:
- Trevisan L. (2011) Dense Model Theorems and Their Applications. In: Ishai Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg
In 2004, Ben Green and Terry Tao  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.