On the differences of primes in arithmetical progressions
Martin Huxley (1969)
Acta Arithmetica
Similarity:
Martin Huxley (1969)
Acta Arithmetica
Similarity:
W. Narkiewicz (1967)
Acta Arithmetica
Similarity:
D. Heath-Brown (1986)
Acta Arithmetica
Similarity:
H. Williams (1972)
Acta Arithmetica
Similarity:
Andrzej Schinzel, Y. Wang (1958)
Annales Polonici Mathematici
Similarity:
Karl Norton (1969)
Acta Arithmetica
Similarity:
J. Bovey (1974)
Acta Arithmetica
Similarity:
M. B. S. Laporta (1997)
Revista Matemática de la Universidad Complutense de Madrid
Similarity:
Given A and B integers relatively prime, we prove that almost all integers n in an interval of the form [N, N+H], where N exp(1/3+e) ≤ H ≤ N can be written as a sum Ap1 + Bp2 = n, with p1 and p2 primes and e an arbitrary positive constant. This generalizes the results of Perelli et al. (1985) established in the classical case A=B=1 (Goldbach's problem).
Jianya Liu, Tao Zhan (1997)
Acta Arithmetica
Similarity:
For a large odd integer N and a positive integer r, define b = (b₁,b₂,b₃) and It is known that . Let ε > 0 be arbitrary and . We prove that for all positive integers r ≤ R, with at most exceptions, the Diophantine equation ⎧N = p₁+p₂+p₃, ⎨ j = 1,2,3,⎩ with prime variables is solvable whenever b ∈ (N,r), where A > 0 is arbitrary.