On some asymptotic formulas in the theory of the ``factorisatio numerorum

DOI10.2307/1968777zbMath0061.07907OpenAlexW2334806229MaRDI QIDQ2652861

Paul Erdős

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

zbMATH Keywords

asymptotic formulasfactorisatio numerorum

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37)

Related Items (12)

On the Factorization of Squarefree Integers ⋮ Über die Anzahl der Produktzerlegungen ganzer Zahlen ⋮ On the maximal order of numbers in the ``factorisatio numerorum problem ⋮ Quadrafree \textit{factorisatio numerorum} ⋮ Large values of the number of factorizations of an integer as an ordered product of primes ⋮ 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 ⋮ On extended Eulerian numbers ⋮ A SURVEY OF FACTORIZATION COUNTING FUNCTIONS ⋮ Polynomial representation growth and the congruence subgroup problem. ⋮ On ordered factorizations into distinct parts

This page was built for publication: On some asymptotic formulas in the theory of the ``factorisatio numerorum