@inproceedings{Knopfmacher2005ASO,
title={A Survey of Factorization Counting Functions},
author={Arnold Knopfmacher and Michael E. Mays},
year={2005}
}

The general field of additive number theory considers questions concerning representations of a given positive integer n as a sum of other integers. In particular, partitions treat the sums as unordered combinatorial objects, and compositions treat the sums as ordered. Sometimes the sums are restricted, so that, for example, the summands are distinct, or relatively prime, or all congruent to ±1 modulo 5. In this paper we review work on analogous problems concerning representations of n as a… CONTINUE READING