Ordered and Unordered Factorizations of Integers
نویسندگان
چکیده
We study the number of ways of writing a positive integer n as a product of integer factors greater than one. We survey methods from the literature for enumerating and also generating lists of such factorizations for a given number n. In addition, we consider the same questions with respect to factorizations that satisfy constraints, such as having all factors distinct. We implement all these methods in Mathematica and compare the speeds of various approaches to generating these factorizations in practice.
منابع مشابه
Labeled Factorization of Integers
The labeled factorizations of a positive integer n are obtained as a completion of the set of ordered factorizations of n. This follows a new technique for generating ordered factorizations found by extending a method for unordered factorizations that relies on partitioning the multiset of prime factors of n. Our results include explicit enumeration formulas and some combinatorial identities. I...
متن کاملA Survey of Factorization Counting Functions
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...
متن کاملDelange’s Tauberian theorem and asymptotic normality of random ordered factorizations of integers
By a suitable shifting-the-mean parametrization at the Dirichlet series level and Delange’s Tauberian theorems, we show that the number of factors in random ordered factorizations of integers is asymptotically normally distributed.
متن کاملA central limit theorem for random ordered factorizations of integers
Write an integer as finite products of ordered factors belonging to a given subset P of integers larger than one. A very general central limit theorem is derived for the number of ordered factors in random factorizations for any subset P containing at least two elements. The method of proof is very simple and relies in part on Delange’s Tauberian theorems and an interesting Tauberian technique ...
متن کاملCommunal Partitions of Integers
There is a well-known formula due to Andrews that counts the number of incongruent triangles with integer sides and a fixed perimeter. In this note, we consider the analagous question counting the number of k-tuples of nonnegative integers none of which is more than 1/(k−1) of the sum of all the integers. We give an explicit function for the generating function which counts these k-tuples in th...
متن کامل