Factorisatio numerorum with constraints

DOI10.1006/JNTH.1993.1071MaRDI QIDQ1310895zbMATH OpenOpenAlexFDO

Authors 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 seriesordered factorizationsquare free factorizationsummatory functionsupper and lower estimates

Mathematics Subject Classification ID

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

Review text

Factorizations of a positive integer \(n= n_ 1 n_ 2 \dots n_ k\) are investigated, where the factors \(n_ i\) are \(>1\) and fulfill some additional constraints specified below. First of all, two factorizations are considered to be equal if a) one of them can be obtained from the other by a permutation of subscripts, b) after ordering of the factors \(n_ j\) with respect to their increasing magnitude, the factors of both factorizations with the same subscript coincide. The author imposes further constraints on the factors so that each of these two cases splits into two subcases. The ``square free case is characterized by \(n_ i\neq n_ j\) for \( i\neq j\) and the ``coprime one is characterized by \((n_ i, n_ j) =1\) for \(i\neq j\). The aim of the paper is to prove some lower and upper estimates for the value of generating Dirichlet series and the summatory functions of the corresponding counting functions for the number of factorizations of \(n\) in these four cases.

Recommendations

• On factorizations into coprime parts
• A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
• The distribution of the number of factors in a factorization
• Dirichlet generating functions and factorization identities
• Some results on Oppenheim's ``factorisatio numerorum function

Cited in

(16)

• Measures of distinctness for random partitions and compositions of an integer
• Distribution of the number of factors in random ordered factorizations of integers
• Integer factorization and finite Fourier series expansion
• The distribution of numbers with many ordered factorizations
• The distribution of numbers with many factorizations
• Dirichlet generating functions and factorization identities
• On factorizations into coprime parts
• scientific article; zbMATH DE number 503356 (Why is no real title available?)
• scientific article; zbMATH DE number 1150448 (Why is no real title available?)
• Quadrafree \textit{factorisatio numerorum}
• Factoring Numbers with Conway’s 150 Method
• Asymptotic bounds for factorizations into distinct parts
• On ordered factorizations into distinct parts
• A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
• 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

This page was built for publication: Factorisatio numerorum with constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310895)