On the maximal order of numbers in the ``factorisatio numerorum problem

DOI10.1016/J.JNT.2006.10.003MaRDI QIDQ880071zbMATH OpenOpenAlexFDO

Authors Martin Klazar, Florian Luca

Publication date 10 May 2007

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0505352

zbMATH Keywords

ordered factorizationsMaximal order

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Rate of growth of arithmetic functions (11N56)

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).

Recommendations

• The distribution of numbers with many ordered factorizations
• On ordered factorizations into distinct parts
• Distribution of the number of factors in random ordered factorizations of integers
• scientific article; zbMATH DE number 7306636
• On a problem of Oppenheim concerning Factorisatio Numerorum

Cites work

• scientific article; zbMATH DE number 3467229 (Why is no real title available?)
• scientific article; zbMATH DE number 473229 (Why is no real title available?)
• scientific article; zbMATH DE number 3096113 (Why is no real title available?)
• scientific article; zbMATH DE number 3107125 (Why is no real title available?)
• A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
• Constructive Bounds on Ordered Factorizations
• Distribution of the number of factors in random ordered factorizations of integers
• Factorisatio numerorum with constraints
• On some asymptotic formulas in the theory of the ``factorisatio numerorum
• On the Factorization of Squarefree Integers
• On the maximal order of numbers in the ``factorisatio numerorum problem
• On the number of ordered factorizations of natural numbers
• Tauberian remainder theorems
• Über die Anzahl der Produktdarstellungen der positiven ganzen Zahlen
• Über die Anzahl der Produktzerlegungen ganzer Zahlen

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
• scientific article; zbMATH DE number 7306636 (Why is no real title available?)
• Large values and champion numbers of Kalmár's arithmetic function
• ON RATIONALITY AND m-FACTORIAL NUMBERS
• Local distribution of ordered factorizations of integers

Describes a project that uses

Uses Software

• OEIS

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)