Currently displaying 1 – 8 of 8

Showing per page

Order by Relevance | Title | Year of publication

On Hilbert’s solution of Waring’s problem

Paul Pollack — 2011

Open Mathematics

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...

An arithmetic function arising from Carmichael’s conjecture

Florian LucaPaul Pollack — 2011

Journal de Théorie des Nombres de Bordeaux

Let φ denote Euler’s totient function. A century-old conjecture of Carmichael asserts that for every n , the equation φ ( n ) = φ ( m ) has a solution m n . This suggests defining F ( n ) as the number of solutions m to the equation φ ( n ) = φ ( m ) . (So Carmichael’s conjecture asserts that F ( n ) 2 always.) Results on F are scattered throughout the literature. For example, Sierpiński conjectured, and Ford proved, that the range of F contains every natural number k 2 . Also, the maximal order of F has been investigated by Erdős and Pomerance. In...

Page 1

Download Results (CSV)