Writing integers as sums of products

Charles E. Chace
1994 Transactions of the American Mathematical Society  
In this paper we obtain an asymptotic expression for the number of ways of writing an integer N as a sum of k products of / factors, valid for k > 3 and / > 2. The proof is an application of the Hardy-Littlewood method, and uses recent results from the divisor problem for arithmetic progressions.
doi:10.1090/s0002-9947-1994-1257641-3 fatcat:hrey6kmhinbi3krlzg753iw3tm