Abstract
In this paper, we study the function [Formula: see text], which we define as the smallest number [Formula: see text] of variables needed to guarantee that the equation [Formula: see text] has nontrivial solutions in each of the [Formula: see text]-adic fields [Formula: see text], regardless of the rational integer coefficients. This generalizes the [Formula: see text] function of Davenport and Lewis. In this paper, we give a sharp upper bound for [Formula: see text] and compute its value for various choices of the degrees.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
