scientific article; zbMATH DE number 3841951
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.
- Extensions of Lagrange Multipliers in Nonlinear Programming
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- scientific article; zbMATH DE number 3646637 (Why is no real title available?)
- scientific article; zbMATH DE number 3718842 (Why is no real title available?)
- scientific article; zbMATH DE number 3477280 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3286662 (Why is no real title available?)
- On Highly Composite and Similar Numbers
- On Highly Composite Numbers
- Répartition Des Nombres Hautement Composés de Ramanujan
- Sur un probleme d'optimisation en nombres entiers
- Landau's function for one million billions
- Highly composite numbers and the Riemann hypothesis
- Some open questions
- New upper bounds for the number of divisors function
- Estimating the counts of Carmichael and Williams numbers with small multiple seeds
- Superior highly composite numbers and the explicit upper bound of generalized divisor functions
- The least primitive root modulo \(p^2\)
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)