## klimenkov 3 years ago How many non-negative integer solutions does this equation have? $x_1+x_2+\ldots+x_N=n$

1. anonymous

Are you considering the solutions to be ordered or unordered? For example, if we wee trying to solve: x + y + z + w = 12 Would the solution (x,y,z,w) = (9,1,1,1) = (1,9,1,1) = (1,1,9,1) = (1,1,1,9) or would that be considered 4 separate solutions? If they are considered the same, then this is a partitions problem, if they are different, then this is a combinations problem.

2. klimenkov

They are different.

3. experimentX

woops!! that's for ... a+b+c+d = N

4. anonymous

For the smaller example: x + y + z + w = 12 The number of solutions can be determined by viewing the problem in the following way: If 12 units (denoted as 12 u's) seperated by 11 spaces (denoted by 11 s's) are lined up, usususususususususususu and we choose any 3 of the s's and let the others disappear, for example: u u s u u u usu u u u usu then the remaining s's seperate the units into four batches. The number of units in these batches can be used as the values of x,y,z, and w.

5. experimentX

a+b = n would make n+1 solutions a +b + c = n would make |dw:1350155772870:dw|

6. experimentX

probably we would add up (summation) n-2 times for n+1

7. klimenkov

Hm.. I would like you to write the whole solution and the expression as an answer.

8. experimentX

honestly I don't know any closed form for this.

9. anonymous

who are you taking to? @experimentX or me?

10. anonymous

For mine, any selection of three s's gives a solution. Thus, the number of solutions is the same as the number of ways of selection 3 things out of 11.

11. klimenkov

You both. I know the answer. I found this problem very interesting.

12. anonymous

you just need to generalize...

13. experimentX

well ... one thing is for sure ... it must have something with to do of the order of N^(N+1)

14. anonymous

You have n units and (N-1) s's. How many ways can you select (N-1) things out of (n-1)

15. klimenkov

Think again. In an hour I will give you an answer.

16. experimentX

1:15 am here ...

17. klimenkov

Do you want it now?

18. experimentX

I'll wait till tomorrow.

19. klimenkov

@cruffo 's method is very good. But he must correct it.

20. anonymous

Right, the are are a few solutions missing - the ones that start with 0 or end in 0

21. experimentX

probably this is related to this http://en.wikipedia.org/wiki/Partition_(number_theory)

22. anonymous

why not just add s's at the beginning and end of the sequence...

23. anonymous

never mind...that won't take care of the others...

24. experimentX

can x's be zero?

25. anonymous

yes, it can, as can any of the variables. But my take on the problem excludes those possibilities.

26. anonymous

My solution won't allow for adjacent s's

27. anonymous

Claim: every arrangement of n u's and (N-1) s's gives a solution.

28. anonymous

so you have a total of n + (N-1) things and you choose where to place (N-1) of them: C(n+N-1, N-1)

29. experimentX

so C(n+N-1, N-1) is your solution?

30. experimentX

|dw:1350157242721:dw|

31. experimentX

|dw:1350157497037:dw|

32. experimentX

can't think at the moment ... Night!! will see solution tomorrow directly. Nevertheless combinatorics has never been my stuff.

33. anonymous

"Mathematics of Choice" by Ivan Niven http://books.google.com/books?id=UrVQYgEACAAJ The best introductory book, IMHO

34. klimenkov

@cruffo is right. I will write a full solution. Let's make a simple model of this problem. Imagine that we have $$n$$ balls. There is no matter what is first, what is the second,..., they are all the same. And we have $$N$$ boxes where to put this balls. You can put this $$n$$ balls in any box that you like. On the picture there are some ways how to put 10 balls into 5 boxes. The number of the balls in the first box is $$x_1$$, in the second - $$x_2$$ ... in the $$N$$-th - $$x_N$$.|dw:1350209158710:dw| Lets make the side of the box as 1 and about the ball as 0. Every placement of the balls in this boxes can be shown as the sequence of $$n+N+1$$ zeros and 1's. For $$n=5$$ and $$N=10$$ an example will be 1000011000011001. But the first and the last term in this sequence must be 1 because they are the sides of the box. If we shift 0's and 1's inside the first and the last 1's we will get the new arrangement in the boxes. But we can replace only $$(n+N+1)-2=n+N-1$$ terms in the sequence. If we choose the places for 1's the place for 0's will be chosen automatically. So we can choose the place for 1's in $$\left(\begin{matrix}n+N-1 \\ N-1\end{matrix}\right)$$ ways because we can shift $$N-1$$ 1's. Or we can shift 0's. then we will have $$\left(\begin{matrix}n+N-1 \\ n\end{matrix}\right)$$ ways. This will be an answer. Hope you understood and enjoyed this interesting problem.

35. experimentX

interesting!!

36. klimenkov

Did you understand or not?

37. experimentX

yeah i see the picture ...

38. klimenkov

Very good!

39. experimentX

never thought i would have such interestingly simple technique.

40. experimentX

*it

41. klimenkov

Try to solve my next ploblem using similar method.

42. experimentX

sure ..