On an equation with prime numbers (Q1916589): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5813256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a diophantine inequality involving prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pjateckii-Sapiro prime number theorem / rank
 
Normal rank

Latest revision as of 12:15, 24 May 2024

scientific article
Language Label Description Also known as
English
On an equation with prime numbers
scientific article

    Statements

    On an equation with prime numbers (English)
    0 references
    10 November 1996
    0 references
    It is well-known that in 1937 I. M. Vinogradov setted the Goldbach conjecture for large odd integers, namely, there is a (computable) \(n_0>0\) such that for any odd integer \(n \geq n_0\) the equation \(n=p_1 + p_2+p_3\) is soluble in primes \(p_1, p_2,p_3\). In this paper the authors investigate a variant of the Goldbach-Vinogradov result by considering the equation \[ N= [p^c_1] + [p^c_2] + [p^c_3] \tag{1} \] where \([x]\) denotes the integral part of the real \(x\). They obtain: Let \(c\) be a given constant with \(1<c < 17/16\) and \(N\) be a sufficiently large positive integer. Then for any \(\varepsilon>0\), \[ \sum \prod^3_{j=1} \log p_j = \biggl\{ \Gamma^3 \bigl((1/c)+1 \bigr)/ \Gamma (3/c) \biggr\} N^{(3/c)-1} + O\biggl( N^{(3/c)-1} \exp \bigl( -(\log N)^{(1/3)- \varepsilon} \bigr) \biggr), \] where the summation \(\sum\) is over all primes \(p_1, p_2, p_3\) satisfying (1) and \(\Gamma\) denotes the Gamma function. This result is parallel to the second author's work [Acta Arith. 61, 289-306 (1992; Zbl 0762.11033)] on the inequality, \(|p^d_1 + p^d_2 + p^d_3-N |<N^{1-(15/(14d))} \log^9N\) where \(1<d<15/14\).
    0 references
    Goldbach-Vinogradov problem
    0 references
    additive problem with prime numbers
    0 references
    0 references
    0 references
    0 references

    Identifiers