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 - The Fusion of Science and Community**

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

Loading...

Similar Threads - Count number integer | Date |
---|---|

Deriving functions relating to condition numbers | Mar 23, 2017 |

Zeta function the the orime counting function | Feb 13, 2012 |

Integration with respect to the counting measure | Jan 14, 2012 |

How would I count the zeros of zsin(z)-1 in a complex disc? | Mar 27, 2010 |

Would i use the fundamental counting principal or is this a permutation | May 23, 2005 |

**Physics Forums - The Fusion of Science and Community**