- #1
- 1,435
- 187
Count the number of integer solutions of (rather, # of integer lattice points such that)
[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.
[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.
Last edited: