Diophantine equations in the primes
Abstract
Let p=(p1,...,pr) be a system of r polynomials with integer coefficients of degree d in n variables x=(x1,...,xn). For a given r-tuple of integers, say s, a general local to global type statement is shown via classical Hardy-Littlewood type methods which provides sufficient conditions for the solubility of p(x)=s under the condition that each of the xi's is prime.
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.