On the number of ordered factorizations of natural numbers

DOI10.1016/S0012-365X(99)00223-XzbMath0970.11036WikidataQ114122922 ScholiaQ114122922MaRDI QIDQ1972137

Benny Chor, Paul Lemke, Ziv Mador

Publication date: 12 July 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

ordered factorizations of natural numbersprobed partial digest problemsequences with two prime factors

Mathematics Subject Classification ID

Asymptotic results on counting functions for algebraic and topological structures (11N45) Biochemistry, molecular biology (92C40) Arithmetic functions; related numbers; inversion formulas (11A25) Distribution of integers with specified multiplicative constraints (11N25)

Related Items (10)

Discrete uniform and binomial distributions with infinite support ⋮ On the maximal order of numbers in the ``factorisatio numerorum problem ⋮ Recursively divisible numbers ⋮ Large values and champion numbers of Kalmár's arithmetic function ⋮ On asymptotic behavior of Dirichlet inverse ⋮ Optimal Base Encodings for Pseudo-Boolean Constraints ⋮ On extended Eulerian numbers ⋮ A SURVEY OF FACTORIZATION COUNTING FUNCTIONS ⋮ On ordered factorizations into distinct parts ⋮ Profinite groups in which the probabilistic zeta function has no negative coefficients

This page was built for publication: On the number of ordered factorizations of natural numbers