Count the number of integer solutions of (rather, # of integer lattice points such that)(adsbygoogle = window.adsbygoogle || []).push({});

[tex]n+\sum_{k=1}^{n} \left| x_{k}\right| \leq N[/tex]

Not homework, so no rush. I have worked it through before with a prof., but he's so brilliant I didn't understand much of anything he said . His solution involed a generating function, something like the coefficient of the blah term in the expansion of blahblah.

Note that the LHS is the height of a polynomial with integer coefficients, although it has nothing to do with the solution.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Count the number of integer solutions

**Physics Forums | Science Articles, Homework Help, Discussion**