Canadian Mathematical Society
Canadian Mathematical Society
  location:  PublicationsjournalsCJM
Abstract view

Six primes and an almost prime in four linear equations

 Printed: Jun 1998
  • Antal Balog
Format:   HTML   LaTeX   MathJax   PDF   PostScript  


There are infinitely many triplets of primes $p,q,r$ such that the arithmetic means of any two of them, ${p+q\over2}$, ${p+r\over2}$, ${q+r\over2}$ are also primes. We give an asymptotic formula for the number of such triplets up to a limit. The more involved problem of asking that in addition to the above the arithmetic mean of all three of them, ${p+q+r\over3}$ is also prime seems to be out of reach. We show by combining the Hardy-Littlewood method with the sieve method that there are quite a few triplets for which six of the seven entries are primes and the last is almost prime.}
MSC Classifications: 11P32, 11N36 show english descriptions Goldbach-type theorems; other additive questions involving primes
Applications of sieve methods
11P32 - Goldbach-type theorems; other additive questions involving primes
11N36 - Applications of sieve methods

© Canadian Mathematical Society, 2014 :