The straightforward but slow way is to just brute-force over all possible factorizations of N!. As the post states, writing N! as a product of factors is equiv

The straightforward but slow way is to just brute-force over all possible factorizations of N!. As the post states, writing N! as a product of factors is equivalent to writing log(N!) as a sum of those factors' logarithms. So log(t(N)) is the smallest bin size such that the factors all "fit" into N bins of that size. This computation is simple to describe and implement, it's just inefficient because there's a combinatorial explosion of possible ways to pack factors into bins. It's an instance of the knapsack problem which is NP-complete.