An additive problem with primes in arithmetic progressions (Q2577871)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An additive problem with primes in arithmetic progressions
scientific article

    Statements

    An additive problem with primes in arithmetic progressions (English)
    0 references
    0 references
    9 January 2006
    0 references
    The well known 3-primes theorem of I. M. Vinogradov gave rise to a number of extensions, like the one proved by Hua, i.e. \[ N=p_1+p_2+p_3^{\lambda} \leqno{(*)} \] can be solved in primes \(p_j\) (\(j=1,2,3\)), for sufficiently large \(N\), provided \(\lambda\) is a natural number. Also, Rademacher (in 1926, before Vinogradov's result !) studied the 3-primes (Goldbach ternary-) problem with primes restricted in arithmetic progressions. The present author combines (hence, generalizes) these two problems (say, Hua-Rademacher), i.e. proves that (given the necessary arithmetic constraints) the equation \((\ast)\) has solutions \(p_j\) into (eventually) distinct arithmetic progressions with the same modulus \(k\), with \(1\leq k\leq N^{\theta}\) (\(0<\theta \leq 1\)). This, in turn, gives another proof of the well-known Linnik Theorem (on the least \(p\) in arithmetic progressions). (Some of the history for the results regarding Hua and Rademacher problems is given in the paper's bibliography.) The proof goes along the usual lines of the circle method (à la Vinogradov), applying zero-free regions and zero-density bounds (weighted over characters and moduli) for Dirichlet's \(L-\)functions (isolating the contribution of Siegel zero into the explicit formulae) to account for arithmetic progressions constraints and the author's results (to appear elsewhere) for exponential sums over prime powers, for the term \(p_3^{\lambda}\) of \((\ast)\).
    0 references
    0 references
    0 references
    0 references
    0 references
    Circle method
    0 references
    0 references