How to count the number of integer solutions to $$x_1+x_2+x_3+x_4+x_5+x_6=25$$
When, $x_1,x_2,x_3$ are odd ($2k+1$) and $x_4,x_5,x_6$ are even ($2k$), $x_i \in N$.
Is there a general formula to calculate things like this?
How to count the number of integer solutions to $$x_1+x_2+x_3+x_4+x_5+x_6=25$$
When, $x_1,x_2,x_3$ are odd ($2k+1$) and $x_4,x_5,x_6$ are even ($2k$), $x_i \in N$.
Is there a general formula to calculate things like this?
Let $x_i=2a_i+1(i=1,2,3)$ and $x_i=2a_i+2(i=4,5,6)$ because all of $x_i$ is integer.
Then the equation changes like this: $a_1+a_2+\cdots+a_6=8$.
The number of ordered pair $(a_1,a_2,\cdots,a_6)$ is $ _6\mathrm H_8={{6+8-1}\choose8}={13\choose8}=1287$.