Diophantine equations in the primes
Number Theory
2015-06-18 v1
Abstract
Let be a system of polynomials with integer coefficients of degree in variables . For a given -tuple of integers, say , a general local to global type statement is shown via classical Hardy-Littlewood type methods which provides sufficient conditions for the solubility of under the condition that each of the 's is prime.
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}
}