2011 | OriginalPaper | Chapter
Dense Model Theorems and Their Applications
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.