Factorisatio numerorum with constraints

DOI10.1006/JNTH.1993.1071zbMath0803.11051OpenAlexW2065130682MaRDI QIDQ1310895

Richard Warlimont

Publication date: 3 January 1995

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

Full work available at URL: https://doi.org/10.1006/jnth.1993.1071

zbMATH Keywords

coprime factorizationgenerating Dirichlet seriessummatory functionsupper and lower estimatesordered factorizationsquare free factorization

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Multiplicative number theory (11N99)

Related Items (11)

Measures of distinctness for random partitions and compositions of an integer ⋮ The distribution of numbers with many factorizations ⋮ 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 ⋮ The distribution of numbers with many ordered factorizations ⋮ A SURVEY OF FACTORIZATION COUNTING FUNCTIONS ⋮ On factorizations into coprime parts ⋮ On ordered factorizations into distinct parts ⋮ Asymptotic bounds for factorizations into distinct parts

This page was built for publication: Factorisatio numerorum with constraints