Friedlander–Iwaniec theorem

In analytic number theory the Friedlander–Iwaniec theorem states that there are infinitely many prime numbers of the form

The first few such primes are The difficulty in this statement lies in the very sparse nature of this sequence: the number of integers of the form

is roughly of the order

The theorem was proved in 1997 by John Friedlander and Henryk Iwaniec.

[1] Iwaniec was awarded the 2001 Ostrowski Prize in part for his contributions to this work.

[2] The theorem was refined by D.R.

Heath-Brown and Xiannan Li in 2017.

[3] In particular, they proved that the polynomial

represents infinitely many primes when the variable

is also required to be prime.

is the prime numbers less than

in the form

log ⁡

π

mod

When b = 1, the Friedlander–Iwaniec primes have the form

, forming the set It is conjectured (one of Landau's problems) that this set is infinite.

However, this is not implied by the Friedlander–Iwaniec theorem.