Counting number of factorizations of a natural number

2008/11/21 by Shamik Ghosh, Ghosh, Shamik
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Mathematics and Applications #Number Theory (math.NT) #cs.DM #graph theory and CDMA systems #math.NT

paper · pdf · doi:10.48550/arxiv.0811.3479

arxiv created 2008/11/21 · openalex publication_date 2008/11/21 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

Related

• Unordered Factorizations with k Parts
• On the number of factorizations of an integer
• On the Oppenheim's "factorisatio numerorum" function
• Number of ordered factorizations and recursive divisors
• On the number of exact factorization of finite Groups