Combinatorics of classifying objects.

36 Views Asked by At

Given a multiset of $n$ primes (with product of multiset less than $2^{n\log n}$) how many ways can we assemble them into $k$ composite number of equal size?

I am looking for asymptotics.