Writing Integers as Sums of Products
Copyright policy )Writing Integers as Sums of Products
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 l factors, valid for k ≥ 3 k \geq 3 and l ≥ 2 l \geq 2 . The proof is an application of the Hardy-Littlewood method, and uses recent results from the divisor problem for arithmetic progressions.
- Williams College United States
Hardy-Littlewood method, asymptotic formula, Representation problems, additive divisor problem, divisor problems for arithmetic progressions, representation of integers as sums of products, Applications of the Hardy-Littlewood method
Hardy-Littlewood method, asymptotic formula, Representation problems, additive divisor problem, divisor problems for arithmetic progressions, representation of integers as sums of products, Applications of the Hardy-Littlewood method
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!