where E(n) =
for x \geq 1, u \geq 3. The paper concludes with an investigation of the largest prime divisors of highly factorable numbers n, i.e. those n for which f(m) < f(n) whenever m < n (in which case f(n) has maximal order). The 118 highly factorable numbers up to 109 are listed, and the algorithm used to obtain them described. Some additional questions are raised.
Classif.: * 11N37 Asymptotic results on arithmetic functions
11N05 Distribution of primes
11B83 Special sequences of integers and polynomials
11A25 Arithmetic functions, etc.
Keywords: number of factorizations of positive integer; maximal order; lower bound for Psi-function; largest prime divisors of highly factorable numbers
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag
|Books||Problems||Set Theory||Combinatorics||Extremal Probl/Ramsey Th.|
|Graph Theory||Add.Number Theory||Mult.Number Theory||Analysis||Geometry|
|Probabability||Personalia||About Paul Erdös||Publication Year||Home Page|