Uncommon

Green–Tao theorem

Theorem about prime numbers

Green–Tao theorem

Uncommon card · No. 118942

In number theory, the Green–Tao theorem, proven by Ben Green and Terence Tao in 2004, states that the sequence of prime numbers contains arbitrarily long arithmetic progressions. In other words, for every natural number k {\displaystyle k} , there exist arithmetic progressions of primes with k {\displaystyle k} terms. The proof is an extension of Szemerédi's theorem. The problem can be traced back to investigations of Lagrange and Waring from around 1770.

Read on Wikipedia

Open boosters, collect cards and trade them. Free to play.

Play for free
Green–Tao theorem – Uncommon Wikipedia card | Wikiverse TCG