magyaddello
New member
- Joined
- Sep 22, 2010
- Messages
- 1
Hi all,
I need your help for this problem. Let N and J be two integers different from zero such that J=<N. We want to determine the number of all possible ways to write N as the sum of J integers >0.
For example, with (N= 10 and J=3) we have eight possibilities:
(1,1,8) ; (1,2,7) ; (1,3,6) ; (1,4,5) ; (2,2,6) ; (2,3,5) ; (2,4,4); (3,3,4)
Thank you
I need your help for this problem. Let N and J be two integers different from zero such that J=<N. We want to determine the number of all possible ways to write N as the sum of J integers >0.
For example, with (N= 10 and J=3) we have eight possibilities:
(1,1,8) ; (1,2,7) ; (1,3,6) ; (1,4,5) ; (2,2,6) ; (2,3,5) ; (2,4,4); (3,3,4)
Thank you
