Hyperbolic prime number theorem

John B. Friedlander, Henryk Iwaniec

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


We count the number S(x) of quadruples \left( x-1 ,x-2 ,x-3 ,x-4 \right) \in \mathbbZ4 for which p = x2-1 + x2-2 + x2-3 + x2-4 \leqslant x is a prime number and satisfying the determinant condition: x 1 x 4∈-∈x 2 x 3∈=∈1. By means of the sieve, one shows easily the upper bound S(x)∈∈x/log x. Under a hypothesis about prime numbers, which is stronger than the Bombieri-Vinogradov theorem but is weaker than the Elliott-Halberstam conjecture, we prove that this order is correct, that is S(x)∈∈x/log x.

Original languageEnglish (US)
Pages (from-to)1-19
Number of pages19
JournalActa Mathematica
Issue number1
StatePublished - Mar 2009

All Science Journal Classification (ASJC) codes

  • General Mathematics


Dive into the research topics of 'Hyperbolic prime number theorem'. Together they form a unique fingerprint.

Cite this