Waring's problem with restricted digits

From MaRDI portal





In this paper the author examines a restricted version of Waring's problem in which the allowed inputs are numbers whose base-\(b\) expansions use only two fixed digits. That is, given integers \(k \geq 2\) and \(b \geq 3\) together with two coprime digits \(d_{1}, d_{2} \in \{0,1,\dots,b-1\}\), let \(S\) be the set of all non-negative integers whose base-\(b\) representation involves only \(d_{1}\) and \(d_{2}\). The main result of the paper shows that every sufficiently large integer can be expressed as a sum of at most \(b^{160k^{2}}\) \(k\)th powers drawn from the sparse set \(S\).\N\NThe result obtained by the author may be viewed as an analogue of Hilbert's theorem (one of the most celebrated results in number theory), which guarantees that the full set of \(k\)th powers is an asymptotic basis of finite order. That is, there is some \(s\) such that every sufficiently large natural number can be written as a sum of at most \(s\) \(k\)th powers of natural numbers.











This page was built for publication: Waring's problem with restricted digits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962531)