On the maximal order of numbers in the ``factorisatio numerorum problem
From MaRDI portal
Publication:880071
DOI10.1016/J.JNT.2006.10.003zbMATH Open1169.11043arXivmath/0505352OpenAlexW1972144610MaRDI QIDQ880071FDOQ880071
Authors: Martin Klazar, Florian Luca
Publication date: 10 May 2007
Published in: Journal of Number Theory (Search for Journal in Brave)
Abstract: Let m(n) be the number of ordered factorizations of n in factors larger than 1. We prove that for every eps>0 n^{rho} m(n) < exp[(log n)^{1/rho}/(loglog n)^{1+eps}] holds for all integers n>n_0, while, for a constant c>0, n^{rho} m(n) > exp[c(log n)^{1/
ho}/(loglog n)^{1/rho}] holds for infinitely many positive integers n, where rho=1.72864... is the real solution to zeta(rho)=2. We investigate also arithmetic properties of m(n) and the number of distinct values of m(n).
Full work available at URL: https://arxiv.org/abs/math/0505352
Recommendations
Arithmetic functions; related numbers; inversion formulas (11A25) Rate of growth of arithmetic functions (11N56)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factorisatio numerorum with constraints
- On some asymptotic formulas in the theory of the ``factorisatio numerorum
- A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
- Über die Anzahl der Produktdarstellungen der positiven ganzen Zahlen
- On the Factorization of Squarefree Integers
- Tauberian remainder theorems
- Distribution of the number of factors in random ordered factorizations of integers
- On the number of ordered factorizations of natural numbers
- Über die Anzahl der Produktzerlegungen ganzer Zahlen
- Constructive Bounds on Ordered Factorizations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the maximal order of numbers in the ``factorisatio numerorum problem
Cited In (18)
- ON MULTIPLICATIVE COMPOSITIONS OF INTEGERS
- On prime-perfect numbers
- The floor quotient partial order
- On ordered factorizations into distinct parts
- On extended Eulerian numbers
- The distribution of numbers with many ordered factorizations
- The distribution of the number of factors in a factorization
- Constructive Bounds on Ordered Factorizations
- On the maximal order of numbers in the ``factorisatio numerorum problem
- Recursively divisible numbers
- On the parity of the number of multiplicative partitions and related problems
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On a mean-value theorem concerning differences of two k-th powers
- The distribution of numbers with many factorizations
- Title not available (Why is that?)
- ON RATIONALITY AND m-FACTORIAL NUMBERS
- Large values and champion numbers of Kalmár's arithmetic function
- Local distribution of ordered factorizations of integers
Uses Software
This page was built for publication: On the maximal order of numbers in the ``factorisatio numerorum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880071)