Some results on Oppenheim's ``factorisatio numerorum function
From MaRDI portal
Publication:5306702
DOI10.4064/AA142-1-3zbMATH Open1213.11020arXiv0807.0986OpenAlexW2070641143MaRDI QIDQ5306702FDOQ5306702
Authors: Florian Luca, Anirban Mukhopadhyay, K. Srinivas
Publication date: 9 April 2010
Published in: Acta Arithmetica (Search for Journal in Brave)
Abstract: Let denote the number of distinct unordered factorisations of the natural number into factors larger than 1.In this paper, we address some aspects of the function .
Full work available at URL: https://arxiv.org/abs/0807.0986
Recommendations
Cited In (18)
- ON MULTIPLICATIVE COMPOSITIONS OF INTEGERS
- “To a Factor <em>prés”</em>: Cayley's Partial Anticipation of the Weierstrass γ-Function
- On prime-perfect numbers
- On the ratio between two factorization functions
- Polynomial approximation of anisotropic analytic functions of several variables
- On the number of factorizations of an integer
- On the number of factorizations of an integer
- Title not available (Why is that?)
- Quadrafree \textit{factorisatio numerorum}
- On the parity of the number of multiplicative partitions and related problems
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Factorisatio numerorum with constraints
- Title not available (Why is that?)
- The distribution of numbers with many factorizations
- Title not available (Why is that?)
- Analytic number theory in India during 2001-2010
- On the treatment of partitions as factorization and further analysis
- On some asymptotic formulas in the theory of the ``factorisatio numerorum
This page was built for publication: Some results on Oppenheim's ``factorisatio numerorum function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5306702)