On Waring–Goldbach problem of mixed powers
Copyright policy )On Waring–Goldbach problem of mixed powers
Let P r denote an almost-prime with at most r prime factors, counted according to multiplicity. In this paper it is proved that for every sufficiently large odd integer N , the equation N = x 2 + p 1 3 + p 2 3 + p 3 3 + p 4 3 + p 5 6 + p 6 7 is solvable with x being an almost-prime P 42 and the other terms powers of primes.
Applications of sieve methods, Waring-Goldbach problem, sieve method, almost-prime, Goldbach-type theorems; other additive questions involving primes, circle method
Applications of sieve methods, Waring-Goldbach problem, sieve method, almost-prime, Goldbach-type theorems; other additive questions involving primes, circle method
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!