- #1
praharmitra
- 311
- 1
Given the following integer equation [tex]x_1 + x_2 + ... x_n = m[/tex] where [tex]x_i \geq 0[/tex] and [tex]x_i[/tex] is an integer for all i.
The number of solutions to the above equation is [tex] ^{n+m-1}C_m[/tex]
I was wondering if we could view this as a selection of [tex]m[/tex] objects from a selection of [tex]n + m - 1[/tex] objects.
Is there a 1-to-1 correspondence between a particular solution of the equation, and a particular selection of m objects from a selection of some n + m - 1 objects.
I hope I have made myself clear. I have tried to figure out such a correspondence, but in vain.
The number of solutions to the above equation is [tex] ^{n+m-1}C_m[/tex]
I was wondering if we could view this as a selection of [tex]m[/tex] objects from a selection of [tex]n + m - 1[/tex] objects.
Is there a 1-to-1 correspondence between a particular solution of the equation, and a particular selection of m objects from a selection of some n + m - 1 objects.
I hope I have made myself clear. I have tried to figure out such a correspondence, but in vain.