A Vinogradov-type problem in almost primes
Abstract
We prove a generalisation of Vinogradov's theorem by finding for m≥slant 3 and fixed positive integers c1, … ,cm, r1, … , rm the asymptotics of the number of sequences (n1, … ,nm) ∈ Nm such that c1n1 + … + cm nm = N and (ni) = ri for every i=1, … ,m under the assumption that at least three of the ri are equal to 1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.