A Survey of Factorization Counting Functions

@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

References

Publications referenced by this paper.
Showing 1-10 of 39 references

On the number of ordered factorizations of natural numbers

Discrete Mathematics • 2000
View 6 Excerpts
Highly Influenced

On the number of multiplicative partitions

J. F. Hughes, J. O. Shallit
Am. Math. Monthly vol 90 • 1983
View 5 Excerpts
Highly Influenced

Extended Bernoulli and Eulerian numbers

L. Carlitz
Duke Math. J. vol 31 • 1964
View 4 Excerpts
Highly Influenced

Distribution of the number of factors in random ordered factorizations of integers

H.-K. Hwang
J. of Number Theory vol 81 • 2000
View 4 Excerpts
Highly Influenced

Theoremes limites pour les structures combinatoires et les fonctiones arithmetiques

H.-K. Hwang
PhD thesis, Ecole Polytechnique • 1994
View 5 Excerpts
Highly Influenced

Factorisatio Numerorum with constraints

R. Warlimont
J. Number Theory vol 45 • 1993
View 3 Excerpts
Highly Influenced

A problem in “Factorisatio Numerorum,

E. Hille
Acta Arith • 1936
View 3 Excerpts
Highly Influenced

On the number of multiplicative partitions of a multi-partite number

J. K. Kim, B. Landman
J. Comb. Math. Comb. Comp. 37 • 2001

Similar Papers

Loading similar papers…