On Goldbach numbers in arithmetic progressions

DOI10.21099/TKBJM/1496164157MaRDI QIDQ5939533zbMATH OpenOpenAlexFDO

Authors H. Mikawa

Publication date 6 February 2002

Published in Tsukuba Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21099/tkbjm/1496164157

zbMATH Keywords

arithmetic progressions Goldbach numbers Goldbach problem sieve methods sums of two primes

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Goldbach-type theorems; other additive questions involving primes (11P32)

Review text

Let \(G(q,k)\) denote the least even integer \(g\) with \(g\equiv k\) (mod \(q\)) that is written as the sum of two primes. In this paper, it is proved that for any fixed number \(J>14/13\), one has \(G(q,k)\ll q^J\) for all odd primes \(q\) and all integers \(k\), where the implied constant depends only on \(J\). This theorem improves the corresponding result of Jutila, in which the lower limit for \(J\) was \(6/5\) in place of \(14/13\). NEWLINENEWLINENEWLINEIn the proof, various techniques in the sieve theory are employed, and the sum \(\sum_{d|n, d<\sqrt{n}}\mu(d)\) plays a very important role, where \(\mu(d)\) denotes the Möbius function. In particular, it is the key observation that the latter sum vanishes whenever \(\mu(n)=1\). The proof also requires numerical estimates for several integrals, and the author evaluates them by hand. As he implies, however, if one would use a computer to estimate those integrals, then one could moderately reduce the limit for \(J\) in the final conclusion.

Recommendations

Cited in

(9)

This page was built for publication: On Goldbach numbers in arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939533)