Counting number of factorizations of a natural number
Discrete Mathematics
2008-11-24 v1 Number Theory
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.
Cite
@article{arxiv.0811.3479,
title = {Counting number of factorizations of a natural number},
author = {Shamik Ghosh},
journal= {arXiv preprint arXiv:0811.3479},
year = {2008}
}