English

Diophantine equations in the primes

Number Theory 2015-06-18 v1

Abstract

Let p=(p1,...,pr)\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r) be a system of rr polynomials with integer coefficients of degree dd in nn variables x=(x1,...,xn)\mathbf{x}=(x_1,...,x_n). For a given rr-tuple of integers, say s\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 p(x)=s\mathfrak{p}(\mathbf{x})=\mathbf{s} under the condition that each of the xix_i's is prime.

Keywords

Cite

@article{arxiv.1312.6309,
  title  = {Diophantine equations in the primes},
  author = {Brian Cook and Ákos Magyar},
  journal= {arXiv preprint arXiv:1312.6309},
  year   = {2015}
}
R2 v1 2026-06-22T02:33:27.649Z