Add to ORKGIt is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers of 2. Under the Generalized Rieman Hypothesis one can replace 13 by 7. Unlike previous work on this problem, the proof avoids numerical calculations with explicit zero-free regions of Dirichlet L-functions. The argument uses a new technique to bound the measure of the set on which the exponential sum formed from powers of 2 is large
In 1951, Linnik proved the existence of a constant $K$ such that every sufficiently large even numbe...
AbstractIn this paper we continue our study, begun in G. Harman and A.V. Kumchev (2006) [10], of the...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers ...
AbstractAs an extension of the Linnik–Gallagher results on the “almost Goldbach” problem, we prove t...
We examine the problem of writing every sufficiently large even number as the sum of two primes and ...
AbstractIn this paper, it is proved that every sufficiently large odd integer is a sum of a prime, f...
AbstractGiven a positive integer l, this paper establishes the existence of constants η > 1 and δ > ...
We prove that the density of integers ≡2 (mod 24), which can be represented as the sum of two square...
AbstractWe prove that the density of integers ≡2 (mod24), which can be represented as the sum of two...
Comments: 43 pages. Most of the manuscript has been professionally proofread.The binary Goldbach con...
large even integers by sums of such powers and of two primes by Hongze Li (Jinan) 1. Main results. T...
Linnik considered about 70 years ago the following approximation to the binary Goldbach problem. Is ...
Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written...
AbstractWe study the representations of large integers n as sums p12+⋯+ps2, where p1,…,ps are primes...
In 1951, Linnik proved the existence of a constant $K$ such that every sufficiently large even numbe...
AbstractIn this paper we continue our study, begun in G. Harman and A.V. Kumchev (2006) [10], of the...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers ...
AbstractAs an extension of the Linnik–Gallagher results on the “almost Goldbach” problem, we prove t...
We examine the problem of writing every sufficiently large even number as the sum of two primes and ...
AbstractIn this paper, it is proved that every sufficiently large odd integer is a sum of a prime, f...
AbstractGiven a positive integer l, this paper establishes the existence of constants η > 1 and δ > ...
We prove that the density of integers ≡2 (mod 24), which can be represented as the sum of two square...
AbstractWe prove that the density of integers ≡2 (mod24), which can be represented as the sum of two...
Comments: 43 pages. Most of the manuscript has been professionally proofread.The binary Goldbach con...
large even integers by sums of such powers and of two primes by Hongze Li (Jinan) 1. Main results. T...
Linnik considered about 70 years ago the following approximation to the binary Goldbach problem. Is ...
Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written...
AbstractWe study the representations of large integers n as sums p12+⋯+ps2, where p1,…,ps are primes...
In 1951, Linnik proved the existence of a constant $K$ such that every sufficiently large even numbe...
AbstractIn this paper we continue our study, begun in G. Harman and A.V. Kumchev (2006) [10], of the...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...