Papers
Topics
Authors
Recent
Search
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.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.