Return to Question

The Green-Tao theorem states that for every $n$, there is an arithmetic sequence of length $n$ consisting of primes.

For primes, $p$, let $P(p)$ be the maximum length of an arithmetic progression of primes whose least element is $p$.

Is it known whether $P(p)=p$ for every prime?

(This clearly generalizes the Green-Tao theorem, asserting that long progressions show up "as soon as possible." Note that $P(p) \leq p$ by viewing the progression mod $p$.)

The Green-Tao theorem states that for every $n$, there is an arithmetic sequence of length $n$ consisting of primes.

For primes, $p$, let $P(p)$ be the maximum length of an arithmetic progression of primes whose least element is $p$.

Is it known whether $P(p)=p$ for every prime?

(This clearly generalizes the Green-Tao theorem, asserting that long progressions show up "as soon as possible." Note that $P(p) \leq p$ by viewing the progression mod $p$.)

By a famous theorem for every $n$ there is an arithmetic sequence of length $n$ consisting of primes.

Let $P(n)$ be the maximum length of an arithmetic progression of primes such that the least element is $n$, has it been proven or disproven that $P(p)=p$ for every prime? If true this clearly generalizes the above theorem.

The Green-Tao theorem states that for every $n$, there is an arithmetic sequence of length $n$ consisting of primes.

For primes, $p$, let $P(p)$ be the maximum length of an arithmetic progression of primes whose least element is $p$.

Is it known whether $P(p)=p$ for every prime?

(This clearly generalizes the Green-Tao theorem, asserting that long progressions show up "as soon as possible." Note that $P(p) \leq p$ by viewing the progression mod $p$.)

By a famous theorem for every $n$ there is an arithmetic sequence of length $n$ consisting of primes.

Let $P(n)$ be the maximum length of an arithmetic progression of primes, has it been proven or disproven that $P(p)=p$ for every prime? If true this clearly generalizes the above theorem.

By a famous theorem for every $n$ there is an arithmetic sequence of length $n$ consisting of primes.

Let $P(n)$ be the maximum length of an arithmetic progression of primes such that the least element is $n$, has it been proven or disproven that $P(p)=p$ for every prime? If true this clearly generalizes the above theorem.