Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!uwvax!crystal!shekita
From: shekita@crys.WISC.EDU (Eugene Shekita)
Newsgroups: sci.math
Subject: simple combinatorics question
Message-ID: <162@crys.WISC.EDU>
Date: Fri, 17-Oct-86 16:21:23 EDT
Article-I.D.: crys.162
Posted: Fri Oct 17 16:21:23 1986
Date-Received: Fri, 17-Oct-86 23:47:03 EDT
Organization: U of Wisconsin CS Dept
Lines: 22

As many of you know, the number of non-negative integer solutions
to the equation:

    x  +  x  + ... +  x  =  m
     1     2           n

is
     C(n + m - 1, n) 

where C(x, y) means x things taken y at a time.

Is there an expression for the number of non-negative integer solutions
to equations of the form:

    c x  +  c x  + ... +  c x  =  m
     1 1     2 2           n n
    
where the c  are positive integer constants?
           i

E. Shekita
shekita@provolone.wisc.edu