A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Writing integers as sums of products
1994
Transactions of the American Mathematical Society
Preserved Fulltext
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