On the number of ordered factorizations of natural numbers
In this paper the authors investigate the function \(H(n)\), defined to be the number of representations of the positive integer \(n\) as an ordered product of factors exceeding 1. They explain how this function arises in molecular biology in the analysis of the probed partial digest problem. In [Acta Arith. 2, 134-144 (1936; Zbl 0015.10002)], \textit{E. Hille} established a recursive rule for \(H(n)\) and showed that \(H(n)=O (n^\rho)\) where \(\rho\) is given by \(\zeta(\rho)=2\) and that, for any \(\varepsilon>0\), \(\lim\sup_{n\to \infty} {H(n)\over n^{\rho- \varepsilon}}= +\infty\) holds. More generally, Hille showed that if \(P\) denotes the set of all positive integers with prime factors restricted to some set \(B\) of primes and \(t=\rho(P)\) is defined by \(\prod_{p\in B}(1-p^{-1})^{-1}=2\), so \(t>1\), then \(H(n)=O (n^{\rho(P)})\) for \(n\in P\). The authors improve these results by showing that \(H(n)<n^{\rho(P)}\) for \(n\in P\). As the authors point out, previously no explicit sequences of integers \(n\) with \(H(n) \geq n^{t(n)}\), where \(\lim_{n\to\infty} t(n)>1\), were known. They were able to remedy this by finding, for \(B\) consisting of the first 2, 3, or 4 primes, explicit sequences \((n_i)\) in the corresponding set \(P\) such that \(H(n_i) \geq n^{t_i}_i\) where \(t_i\to \rho(P)\) as \(i\to\infty\).
- Constructive Bounds on Ordered Factorizations
- scientific article; zbMATH DE number 3015574
- On the Greatest and Least Prime Factors of n !+1
- Some results on additive number theory, II
- scientific article; zbMATH DE number 495890
- A lower bound on the number of solutions to the probed partial digest problem
- On the Number of Times an Integer Occurs as a Binomial Coefficient
- On digital distribution in some integer sequences
- On the number of factorizations of an integer
- An arithmetical problem
- On extended Eulerian numbers
- Discrete uniform and binomial distributions with infinite support
- The distribution of numbers with many ordered factorizations
- A natural partial order on the prime numbers
- Optimal base encodings for pseudo-Boolean constraints
- On asymptotic behavior of Dirichlet inverse
- Profinite groups in which the probabilistic zeta function has no negative coefficients
- ON RATIONALITY AND m-FACTORIAL NUMBERS
- scientific article; zbMATH DE number 7306636 (Why is no real title available?)
- On ordered factorizations into distinct parts
- Constructive Bounds on Ordered Factorizations
- A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
- Recursively divisible numbers
- On the maximal order of numbers in the ``factorisatio numerorum problem
- A bijection for ordered factorizations
- Large values of the number of factorizations of an integer as an ordered product of primes
- Large values and champion numbers of Kalmár's arithmetic function
This page was built for publication: On the number of ordered factorizations of natural numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972137)
