2000 character limit reached
Diophantine equations in the primes
Published 21 Dec 2013 in math.NT | (1312.6309v1)
Abstract: Let $\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r)$ be a system of $r$ polynomials with integer coefficients of degree $d$ in $n$ variables $\mathbf{x}=(x_1,...,x_n)$. For a given $r$-tuple of integers, say $\mathbf{s}$, a general local to global type statement is shown via classical Hardy-Littlewood type methods which provides sufficient conditions for the solubility of $\mathfrak{p}(\mathbf{x})=\mathbf{s}$ under the condition that each of the $x_i$'s is prime.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.