No label defined (Q4252229)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1305351
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1305351

      Statements

      31 October 1999
      0 references
      multiplicative analogue of Goldbach's problem
      0 references
      representation of powers of integers as products of powers of shifted primes
      0 references
      exceptional primes
      0 references
      Selberg's sieve
      0 references
      Brun's sieve
      0 references
      large sieve
      0 references
      theorem of Bombieri-Vinogradov
      0 references
      mean values of bounded multiplicative function
      0 references
      A multiplicative analogue of Goldbach's conjecture states that every positive rational number \(\rho\) (with odd numerator and odd denominator) has, for each sufficiently large integer \(N\), a representation \( \displaystyle\rho = {N-p \over N-q} \) with primes \( p, q < N \). Using deep results from sieve theory and multiplicative number theory, the author proves: {\parindent 12pt\narrower There is an integer \(k, 1 \leq k \leq 16 \), so that for all sufficiently large \( N \), each integer \(n\) in \( 1 \leq n \leq \log\log N, \text{ gcd}(n,N) = 1, \) has a representation \[ n^k = \prod_{\substack{ p < {5 \over 6} N \\ p \text{prime}}} (N-p)^{d_p} \] with integers \( d_p \) (possibly depending on \(n\)). } The proof of this result depends on upper and lower estimates for \[ S = \sum{}_{\substack{ rtm = N-p, p \text{prime},\;(p,N) =1,\;{2M \over 3} < m \leq M, \quad (m,N) = 1\\ {3T \over 4 r} < t \leq {7T \over 8r},\;(t,Nr) = 1,\;t \equiv 1 \text{mod} D, (q,t)=1 \text{ for all } q,}} h(m) \] with some suitable arithmetical function \(h\) and a sequence of ``exceptional'' primes \(q\). The upper estimate uses Selberg's and Brun's sieve method and a variant of the large sieve. As a by-product, a uniform asymptotic evaluation of \[ \mathop{{\sum}^*}_{\substack{ \beta y \leq t \leq y \\ (t,Nr) = 1}} 1 \] is given, where \(^*\) indicates that \(t\) is not divisible by ``exceptional'' primes. For a lower bound, elementary arguments, the Bombieri-Vinogradov theorem, and a uniform asymptotic formula for \[ \mathop{{\sum}^*}_{\substack{ \beta x < t \leq x \\ (t,Nr) = 1, t \equiv b (D)}} \sum_{d|t} k(d) \] is used; \(k(\cdot)\) is an arithmetical function satisfying \( k(d) \ll d^{-{1 \over 2 }}. \) This estimate uses asymptotic formulae for sums \[ \sum_{n \leq x, \text{gcd}(n,B)=1} g(n) \] with multiplicative functions \( g: {\mathbb N} \to {\mathbb C}, |g|\leq 1 \). For the entire collection see [Zbl 0911.00018].
      0 references

      Identifiers