Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Hilbert-Waring theorem

Sortuj według:

Ogranicz wyniki do:

On Hilbert’s solution of Waring’s problem

100%

Pollack P.

Open Mathematics

2011

tom 9

nr 2

294-301

In 1909, Hilbert proved that for each fixed k, there is a number g with the following property: Every integer N ≥ 0 has a representation in the form N = x 1k + x 2k + … + x gk, where the x i are nonnegative integers. This resolved a conjecture of Edward Waring from 1770. Hilbert’s proof is somewhat unsatisfying, in that no method is given for finding a value of g corresponding to a given k. In his doctoral thesis, Rieger showed that by a suitable modification of Hilbert’s proof, one can give explicit bounds on the least permissible value of g. We show how to modify Rieger’s argument, using ideas of F. Dress, to obtain a better explicit bound. While far stronger bounds are available from the powerful Hardy-Littlewood circle method, it seems of some methodological interest to examine how far elementary techniques of this nature can be pushed.

Ograniczanie wyników

1 Open Mathematics

1 Pollack P.

1 2011

Wyniki wyszukiwania

On Hilbert’s solution of Waring’s problem