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 Edit this on Wikidata


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




Cites Work


Cited In (18)

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)