pith. sign in

arxiv: 1212.4800 · v1 · pith:G4AL4NMDnew · submitted 2012-12-19 · 🧮 math.NT

Random diophantine equations, I

classification 🧮 math.NT
keywords equationsalmostdiophantinesolublesolutionadditiveadmitbest
0
0 comments X
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.