Quadrafree \textit{factorisatio numerorum}
As the title suggests, the author investigates the function which associates to a positive integer \(n\) the number \(f_2(n)\) of factorizations of \(n\) in squarefree parts, where the order of the factors does not count. The main results are a formula for \(f_2(n^2)\) when \(n\) is squarefree which involves Bell numbers and an asymptotic for the summatory function of \(f_2(n)\) in the initial interval \(n\in [1,x]\) as \(x\to\infty\). The combinatorial results use a method of Rota while the proof of the analytic result uses standard machinery of complex integration.
- A problem in "Factorisatio Numerorum"
- A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
- Estimating the number of multiplicative partitions
- Factorisatio numerorum with constraints
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- NIST digital library of mathematical functions
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On some asymptotic formulas in the theory of the ``factorisatio numerorum
- On the number of factorizations of an integer
- Some results on Oppenheim's ``factorisatio numerorum function
- The Number of Partitions of a Set
This page was built for publication: Quadrafree \textit{factorisatio numerorum}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457941)
