Skip to main content
1 of 3
Mayank Pandey
  • 1.9k
  • 11
  • 18

Asymptotic Formala for the number of ways to write a number as the sum of $k$ triangular numbers

How would one derive an asymptotic formula for the number of representations of a number $n$ as the sum of $k$ numbers of the form $\frac{m(m + 1)}{2}$

I think that one could use the circle method, but I don't know how to deal with the extra term in the $\frac{m^2 + m}{2}$.

Mayank Pandey
  • 1.9k
  • 11
  • 18