Vinogradov's theorem with almost equal summands
Abstract
Let θ > 11/20. We prove that every sufficiently large odd integer n can be written as a sum of three primes n = p1 + p2 + p3 with |pi - n/3| ≤ nθ for i∈\1,2,3\.
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.