scientific article; zbMATH DE number 3841951

From MaRDI portal
Publication:3312306





An integer \(n=\prod^{\infty}_{k=1}p_ k^{x_ k}\) is called highly composite iff \(n\) is a solution of the integer programming problem: \[ Max\{\sum^{\infty}_{k=1}\log(x_ k+1)\mid \sum^{\infty}_{k=1}x_ k\quad \log p_ k\leq \log N_ 0\}. \] In the paper it is proved that this problem may be solved by the dynamic programming method and the corresponding algorithm is given. The table of the first 5.000 highly composite numbers constructed by the algorithm is used to disprove \textit{L. Alaoglu} and \textit{P. Erdős'} conjecture [Trans. Am. Math. Soc. 56, 448--469 (1944; Zbl 0061.07903)]. As an application of the method the least positive integer with more than \(10^{1.000}\) divisors is constructed.











This page was built for publication:

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