Ordered Factorizations with k Factors

Publication date 16 October 2016

Abstract: We give an overview of combinatoric properties of the number of ordered

k

-factorizations

f_{k} (n, l)

of an integer, where every factor is greater or equal to

l

. We show that for a large number

k

of factors, the value of the cumulative sum

F_{k} (x, l) = s u m o l i m i t s_{n l e q x} f_{k} (n, l)

is a polynomial in

l f l o o r l o g_{l} x f l o o r

and give explicit expressions for the degree and the coefficients of this polynomial. An average order of the number of ordered factorizations for a fixed number

k

of factors greater or equal to 2 is derived from known results of the divisor problem.

This page was built for publication: Ordered Factorizations with $k$ Factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6278672)