No label defined (Q3312306)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3841951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3841951 |
Statements
1983
0 references
generalized Lagrange multipliers method
0 references
Everett theorem
0 references
Nicolas benefit method
0 references
table
0 references
integer programming
0 references
nonlinear programming
0 references
dynamic programming
0 references
highly composite numbers
0 references
0 references
0.7733972072601318
0 references
0.749146044254303
0 references
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.
0 references