论文标题
关于$ n $的分区数量，其汇总产品最多为$ n $
On the number of partitions of $n$ whose product of the summands is at most $n$
论文作者
论文摘要
我们证明了一个明确的公式来计算$ n $的分区，其汇总产品最多是$ n $。在此过程中，我们还推断出结果来计算$ n $的乘法分区。
We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.
