Factorisatio numerorum with constraints (Q1310895)

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.