Quasi-amicable numbers are rare.
On Hilbert’s solution of Waring’s problem
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...
Long gaps between deficient numbers
Arithmetic properties of polynomial specializations over finite fields
Powerful amicable numbers
How many primes can divide the values of a polynomial?
On the distribution of some integers related to perfect and amicable numbers
An arithmetic function arising from Carmichael’s conjecture
Let denote Euler’s totient function. A century-old conjecture of Carmichael asserts that for every , the equation has a solution . This suggests defining as the number of solutions to the equation . (So Carmichael’s conjecture asserts that always.) Results on are scattered throughout the literature. For example, Sierpiński conjectured, and Ford proved, that the range of contains every natural number . Also, the maximal order of has been investigated by Erdős and Pomerance. In...
Page 1