Random diophantine equations, I
classification
🧮 math.NT
keywords
equationsalmostdiophantinesolublesolutionadditiveadmitbest
read the original abstract
We consider additive diophantine equations of degree $k$ in $s$ variables and establish that whenever $s\ge 3k+2$ then almost all such equations satisfy the Hasse principle. The equations that are soluble form a set of positive density, and among the soluble ones almost all equations admit a small solution. Our bound for the smallest solution is nearly best possible.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.