On some asymptotic formulas in the theory of the ``factorisatio numerorum
From MaRDI portal
Publication:2652861
DOI10.2307/1968777zbMath0061.07907MaRDI QIDQ2652861
Publication date: 1941
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e5eeff4540b8dd3512ea2c525f25d12506bbea06
11N37: Asymptotic results on arithmetic functions
Related Items
On ordered factorizations into distinct parts, A SURVEY OF FACTORIZATION COUNTING FUNCTIONS, On the Factorization of Squarefree Integers, Quadrafree \textit{factorisatio numerorum}, On the maximal order of numbers in the ``factorisatio numerorum problem, Large values of the number of factorizations of an integer as an ordered product of primes, On extended Eulerian numbers, Polynomial representation growth and the congruence subgroup problem., Distribution of the number of factors in random ordered factorizations of integers, Dirichlet matrices: determinants, permanents and the \textit{Factorisatio Numerorum} problem, The distribution of numbers with many ordered factorizations, Über die Anzahl der Produktzerlegungen ganzer Zahlen